Abstract
The paper deals with a single machine scheduling problem with deteriorating jobs and group technology (GT) assumption. By deteriorating jobs and group technology assumption, we mean that the group setup times and job processing times are both simple linear functions of their starting times. We show that the makespan minimization problem with release dates can be solved in polynomial time.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
