Industrial Engineering and Management Systems

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

A Flexible Branch and Bound Method for the Job Shop Scheduling Problem

  • Morikawa, Katsumi (Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University) ;
  • Takahashi, Katsuhiko (Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University)
  • Received : 2009.03.31
  • Accepted : 2009.10.12
  • Published : 2009.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper deals with the makespan minimization problem of job shops. The problem is known as one of hard problems to optimize, and therefore, many heuristic methods have been proposed by many researchers. The aim of this study is also to propose a heuristic scheduling method for the problem. However, the difference between the proposed method and many other heuristics is that the proposed method is based on depth-first branch and bound, and thus it is possible to find an optimal solution at least in principle. To accelerate the search, when a node is judged hopeless in the search tree, the proposed flexible branch and bound method can indicate a higher backtracking node. The unexplored nodes are stored and may be explored later to realize the strict optimization. Two methods are proposed to generate the backtracking point based on the critical path of the current best feasible schedule, and the minimum lower bound for the makespan in the unexplored sub-problems. Schedules are generated based on Giffler and Thompson's active schedule generation algorithm. Acceleration of the search by the flexible branch and bound is confirmed by numerical experiment.

Keywords

References

  1. Brinkkotter, W. and Brucker, P. (2001), Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments, Journal of Scheduling, 4, 53-64 https://doi.org/10.1002/1099-1425(200101/02)4:1<53::AID-JOS59>3.0.CO;2-Y
  2. Brucker, P., Jurisch, B., and Sievers, B. (1994), A branch and bound algorithm for the job-shop scheduling problem, Discrete Applied Mathematics, 49, 107-127 https://doi.org/10.1016/0166-218X(94)90204-6
  3. Carlier, J. (1982), The one-machine sequencing problem, European Journal of Operational Research, 11, 42-47 https://doi.org/10.1016/S0377-2217(82)80007-6
  4. Carlier, J. and Pinson, E. (1989), An algorithm for solving the job-shop problem, Management Science, 35, 164-176 https://doi.org/10.1287/mnsc.35.2.164
  5. Giffler, B. and Thompson, G. L. (1960), Algorithms for solving production-scheduling problems, Operations Research, 8, 487-503 https://doi.org/10.1287/opre.8.4.487
  6. Gueret, C., Jussien, N., and Prins, C. (2000), Using intelligent backtracking to improve branch-and-bound methods: An application to open-shop problems, European Journal of Operational Research, 127, 344-354 https://doi.org/10.1016/S0377-2217(99)00488-9
  7. Kawata, Y., Morikawa, K., Takahashi, K., and Nakamura, N. (2003), Robustness optimization of the minimum makespan schedules in a job shop, International Journal of Manufacturing Technology and Management, 5, 1-9 https://doi.org/10.1504/IJMTM.2003.002524
  8. Morikawa, K., Takahashi, K., and Tabata, K. (2005), Branch and bound based makespan minimization in job shops guided by search history, Proceedings of the 18th International Conference on Production Research, Salerno, Italy, (in CD-ROM)
  9. Perregaard, M. and Clausen, J. (1998), Parallel branchand- bound methods for the job-shop scheduling problem, Annals of Operations Research, 83, 137-160 https://doi.org/10.1023/A:1018903912673
  10. Pezzella, F. and Merelli, E. (2000), A tabu search method guided by shifting bottleneck for the job shop scheduling problem, European Journal of Operational Research, 120, 297-310 https://doi.org/10.1016/S0377-2217(99)00158-7