Abstract
The ordered flow-shop scheduling problem deals with the case where processing times follow a specific structure. We extend the ordered flow-shop scheduling to the coupled tasks setting, i.e., the coupled task ordered flow-shop, in which an exact delay exists between the consecutive tasks of each job. The aim is to minimize the makespan. The coupled task flow-shop with distinct delays between the consecutive tasks of the jobs is known to be strongly NP-hard, even for two machines and the unit execution time tasks. We investigate the problem when delays follow the ordered structure and show that the optimal permutation schedule has the pyramidal-shaped property. We also introduce two polynomially solvable cases.
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.
