Abstract
Abstract This paper studies general, no-wait or no-idle flow shop scheduling problems with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times. A linear deterioration function with identical normal processing times of all jobs is assumed and some dominating relationships between machines can be satisfied. For the makespan minimization problems, the following dominant machines constraint: idm, ddm, idm–ddm and ddm–idm are considered. We show that these problems can be solved in polynomial time, although these problems are more complicated than the classical ones.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
