Abstract
In this paper we study an extension of the job-shop scheduling problem where the job routings are directed acyclic graphs that can model partial orders of operations and that contain sets of alternative subgraphs consisting of several operations each. We develop two heuristic algorithms for our problem: a tabu search and a genetic algorithm. The two heuristics are based on two common subroutines: one to insert a set of operations into a partial schedule and another to improve a schedule with fixed routing alternatives. The first subroutine relies on an efficient operation insertion technique and the second one is a generalisation of standard methods for classical job-shop scheduling. We compare our heuristics on various test problems, including the special case MPM job-shop scheduling. Moreover, we report on the success of the two subroutines on open-shop instances.
Sign-in/Register to access full text options 
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.
