Abstract
A new heuristic algorithm for large-scale job shop scheduling problem is proposed based on operation decomposition using bottleneck machine. It detects bottleneck machine by orthogonal experiment. Based on the operations which are processed on the bottleneck machine, the large-scale job shop scheduling problem is divided into three sub-problems: the scheduling problem of the operations on bottleneck machine, pre-bottleneck machines and post-bottleneck machines. The operations on bottleneck machine are first scheduled by dispatching rules, and the other two sub-problems are solved by genetic algorithm to subordinate the schedule of the operations on bottleneck machine. A number of simulation results shown that the scheduling strategy and technique for the problem can improve the computing efficiency and quality of the solution.
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.
