Abstract
Design/methodology/approach: In the algorithm, a number of sub-problems are constructed by iteratively decomposing the large-scale JSP according to the process route of each job. And then the solution of the large-scale JSP can be obtained by iteratively solving the sub-problems. In order to improve the sub-problems' solving efficiency and the solution quality, a detection method for multi-bottleneck machines based on critical path is proposed. Therewith the unscheduled operations can be decomposed into bottleneck operations and non-bottleneck operations. According to the principle of “Bottleneck leads the performance of the whole manufacturing system” in TOC (Theory Of Constraints), the bottleneck operations are scheduled by genetic algorithm for high solution quality, and the non-bottleneck operations are scheduled by dispatching rules for the improvement of the solving efficiency.
Highlights
The job shop scheduling problem (JSP) is a well-known NP-hard problem (Pinedo, 2008; Qingdaoerji, Wang & Wang, 2013)
In the solving process of the sub-problems, the bottleneck operations are scheduled by genetic algorithm for high solution quality, and the non-bottleneck operations are scheduled by dispatching rules for the improvement of the solving efficiency
In order to improve the global optimality of the decomposition heuristics based on multi-bottleneck machines (DH-MB), we propose a strategy that is evaluating the chromosome's fitness in the sub-problem by predicting the global scheduling objective (EF-PGSO) of the original JSP
Summary
The job shop scheduling problem (JSP) is a well-known NP-hard problem (Pinedo, 2008; Qingdaoerji, Wang & Wang, 2013). Machine capacity constraints or operation precedence constraints are relaxed, and the relaxed problem is decomposed into single machine or single job scheduling sub-problems. These sub-problems are approximately solved by using fast heuristic algorithms. For the problems with the same scale, it is more difficult to solve the problem with a large number of machines than the problem with a. A decomposition heuristics based on multi-bottleneck machines (DH-MB) is proposed for the JSP with a large number of machines.
Sign-in/Register to view highlights & summary 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.
