Abstract
In this paper we conside generalized shop scheduling problems, where arbitrary precedence constraints among the operations are given (general shop), sequencedependent changeover times between the processing of operations are taken into consideration, multiprocessor requirements of operations can occur and, in each technological stage of a job, several identical machines of the corresponding type may be available (hybrid or flexible shop). Also the number of machines of each type that are used is not fixed a priori . The objective is to minimize an arbitrarily given non-decreasing function in the completion times of the operations and in the numbers of machines of each type which have been used. By applying the mixed multigraph model, we propose two heuristic decomposition procedures and several algorithms for constructing and improving a schedule. The algorithms developed have been tested on a set of problems with up to 20 jobs and up to 10 machine types.
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.
