Abstract
We consider shop scheduling problems with group-technology. Groups of jobs are given to schedule them in a flow shop or open shop environment to minimize makespan. Setups have to be performed whenever two jobs of different groups are processed consecutively on the same machine. We show both problems to be NP-hard even in the two-machine case and give several algorithms for solving special cases of the open shop problem.
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.
