Abstract
We study the problem of scheduling N independent jobs in a job-shop environment. Each job must be processed on at most M machines according to individual routes. The objective is to minimise the maximum completion time of the jobs. First, the job-shop problem is reduced to a flow-shop problem with job precedence constraints. Then, an extension of Johnson's rule is defined to solve it. The optimality of the extended Johnson's rule is proved for two machine job-shop problems and the rule efficiency for some three and four machine job-shop problems is shown.
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.
