Industrial Engineering and Management Systems

  • 제7권2호
  • /
  • Pages.84-92
  • /
  • 2008
  • /
  • 1598-7248(pISSN)
  • /
  • 2234-6473(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

A Comparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Problem

  • Sun, Ji Ung (School of Industrial and Managment Engineering Hankuk University of Foreign Studies)
  • 발행 : 2008.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Scheduling is one of the most important issues in the planning and operation of production systems. This paper investigates a general job shop scheduling problem with reentrant work flows and sequence dependent setup times. The disjunctive graph representation is used to capture the interactions between machines in job shop. Based on this representation, four two-phase heuristic procedures are proposed to obtain near optimal solutions for this problem. The obtained solutions in the first phase are substantially improved by reversing the direction of some critical disjunctive arcs of the graph in the second phase. A comparative study is conducted to examine the performance of these proposed algorithms.

키워드

참고문헌

  1. Adams, J., Balas, E., and Zawack, D. (1988), The shifting bottleneck procedure for job shop scheduling, Management Science, 3, 391-401.
  2. Ahn, S. H. (1995), A study on algorithm to minimize makespan of sequenc-dependent jobs, Journal of the Korean Institute of Management Science, 12, 77-87.
  3. Artigues, C. and Roubellat, F. (2002), An efficient algorithm for operation insertion in a multi-resource jobshop schedule with sequence-dependent setup times, Production Planning and Control, 13, 175-186. https://doi.org/10.1080/09537280110069757
  4. Asano, M. and Ohta, H. (1999), Scheduling with shutdowns and sequence dependent set-up times, International Journal of Production Research, 37, 1661- 1676. https://doi.org/10.1080/002075499191184
  5. Balas, E. (1969), Machine sequencing via disjunctive graphs: an implicit enumeration approach, Operations Research, 17, 941-957. https://doi.org/10.1287/opre.17.6.941
  6. Balas, E., Lenstra, J. K., and Vazacopoulos, E. (1995), The one machine problem with delayed precedence constraints and its use in job shop scheduling, Management Science, 41, 94-109. https://doi.org/10.1287/mnsc.41.1.94
  7. Blanco, L., Dell'olmo, P., and Giordani, S. (1999), Flow shop no-wait scheduling with sequence dependent set-up times and release dates, INFOR Journal, 37, 3-11.
  8. Chu, C., Proth, J. M., and Wang, C. (1998), Improving job-shop schedules through critical pairwise exchanges, International Journal of Production Research, 36, 683-694. https://doi.org/10.1080/002075498193633
  9. Conway, R. W., Maxwell W. L., and Miller L. W. (1967), Theory of Scheduling, Addison-Wesley, Reading, MA.
  10. Corwin, B. D. and Esogbue, A. O. (1974), Two machine flow shop scheduling problems with sequence dependent setup times : A dynamic programming approach, Naval Research Logistics Quarterly, 21, 515-524. https://doi.org/10.1002/nav.3800210311
  11. Flynn, B. B. (1987), Repetitive lots: the use of a sequence-dependent set-up time scheduling procedure in group technology and traditional shops, Journal of Operations Management, 7, 203-216. https://doi.org/10.1016/0272-6963(87)90017-9
  12. Gupta, J. N. D. (2002), An excursion in scheduling theory: an overview of scheduling research in the twentieth century, Production Planning and Control, 13, 105- 116. https://doi.org/10.1080/09537280110069612
  13. Gupta, J. N. D. (1986), The two machine sequence dependent flow shop scheduling problem, European Journal of Operations Research, 24, 439-446. https://doi.org/10.1016/0377-2217(86)90037-8
  14. Gupta, S. K. (1982), N jobs and m machines job-shop problems with sequence dependent setup times, International Journal of Production Research, 20, 643-656. https://doi.org/10.1080/00207548208947793
  15. Hwang, H. and Sun, J. U. (1998), Production sequencing problem with re-entrant work flows and sequence dependent setup times, International Journal of Production Research, 36, 2435-2450. https://doi.org/10.1080/002075498192616
  16. Kagr, L. L. and Thompson, G. L. (1964), A heuristic approach to the traveling salesman, Management Science, 11, 225-248.
  17. Kim, S. C. and Bobrowski, P. M. (1994), Impact of sequence- dependent setup time on job shop scheduling performance, International Journal of Production Research, 32, 1503-1520. https://doi.org/10.1080/00207549408957019
  18. Norman, B. A. (1999), Scheduling flowshops with finite buffers and sequence-dependent setup times, Computers and Industrial Engineering, 36, 163-177. https://doi.org/10.1016/S0360-8352(99)00007-8
  19. Ovacik, I. M. and Uzsoy, R. (1995), Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times, International Journal of Production Research, 33, 3173-3192 https://doi.org/10.1080/00207549508904867
  20. Ovacik, I. M. and Uzsoy, R. (1997), Decomposition Methods for Complex Factory Scheduling Problems, Norwell, MA: Kluwer Academic.
  21. Radhakrishnan, S. and Ventura, J. A. (2000), Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times, International Journal of Production Research, 38, 2233-2252. https://doi.org/10.1080/00207540050028070
  22. Sun, J. U. and Hwang, H. (2001), Scheduling problem in a two-machine flow line with the N-step prior-jobdependent set-up times, International Journal of Systems Science, 32, 375-385. https://doi.org/10.1080/002077201300029764
  23. Sun, X., Noble, J. S., and Klein, C. M. (1999), Singlemachine scheduling with sequence dependent setup to minimize total weighted squared tardiness, IIE Transactions, 31, 113-124.
  24. Uskup, E. and Smith, S. B. (1975), A branch-and-bound algorithm for two-stage production-sequencing problems, Operations Research, 23, 118-136. https://doi.org/10.1287/opre.23.1.118
  25. Uzsoy, R. and Wang, C. S. (2000), Performance of decomposition procedures for job shop scheduling problems with bottleneck machines, International Journal of Production Research, 38, 1271-1286. https://doi.org/10.1080/002075400188843
  26. Wilbrecht, J. K. and Prescott, E. (1969), The influence of set-up time on job shop performance, Management Science, 16, 274-280. https://doi.org/10.1287/mnsc.16.4.B274
  27. Zhu, X. and Wilhelm, W. (2006), Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Transactions, 38, 987-1007. https://doi.org/10.1080/07408170600559706
  28. Zoghby, J., Barnes, J. W., and Hasenbein, J. J. (2005), Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches. European Journal of Operational Research, 167, 336-348. https://doi.org/10.1016/j.ejor.2004.03.027