A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization

作者：Topaloglu Seyda^*; Kilincli Gamze

来源：International Journal of Advanced Manufacturing Technology, 2009, 44(7-8): 781-794.

DOI：10.1007/s00170-008-1881-y

• Reentrant job shop scheduling problem
• Shifting bottleneck heuristic
• Makespan minimization
• Single-machine maximum lateness problem

This paper proposes a modified shifting bottleneck heuristic (MSBH) for the reentrant job shop scheduling problem (RJSSP) with makespan minimization objective. Recently, the reentrant job shop has come into prominence as a new type of manufacturing shop. The principle characteristic of a reentrant job shop is that a job may visit certain machines more than once during the process flow, whereas in the classic job shop, each job visits a machine only once. The shifting bottleneck heuristic (SBH) is one of the most successful heuristic approaches for the classical job shop scheduling problem, which decomposes the problem into a number of single-machine subproblems. This paper adapts the SBH for the RJSSP and proposes a new sequencing heuristic for the single-machine maximum lateness subproblem considering the reentrant jobs in order to handle large-size RJSSPs. It also uses a subproblem criticality measure that further shortens the implementation time. The proposed MSBH is tested by using instances up to 20 machines and 100 jobs, and it is illustrated that good quality solutions can be obtained in reasonable computational times. A real-life application of the MSBH is also given as a case study to evaluate its performance.

• 出版日期2009-10