Abstract

This paper deals with the so-called general machine scheduling problems. In the general machine scheduling problems, job shop type jobs and open shop type jobs are scheduled together and the imposition of precedence constraints is allowed between operations belonging to either the same job or different jobs. This paper proposes a genetic algorithm to solve such general machine scheduling problems. Some experimental results are presented to show the applicability of the proposed method. The method can be used to solve traditional job shop scheduling, flow shop scheduling, and open shop scheduling as well as general machine scheduling problems.

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 call

Disclaimer: 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.