IE interfaces (산업공학)

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

A Restricted Neighborhood Generation Scheme for Parallel Machine Scheduling

병렬 기계 스케줄링을 위한 제한적 이웃해 생성 방안

  • Shin, Hyun-Joon (Department of Industrial Engineering, Texas A&M University) ;
  • Kim, Sung-Shick (Department of Industrial Systems and Information Engineering., Korea University)
  • 신현준 (Texas A&M University 산업공학과) ;
  • 김성식 (고려대학교 산업시스템정보공학과)
  • Received : 20020800
  • Accepted : 20021000
  • Published : 2002.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we present a restricted tabu search(RTS) algorithm that schedules jobs on identical parallel machines in order to minimize the maximum lateness of jobs. Jobs have release times and due dates. Also, sequence-dependent setup times exist between jobs. The RTS algorithm consists of two main parts. The first part is the MATCS(Modified Apparent Tardiness Cost with Setups) rule that provides an efficient initial schedule for the RTS. The second part is a search heuristic that employs a restricted neighborhood generation scheme with the elimination of non-efficient job moves in finding the best neighborhood schedule. The search heuristic reduces the tabu search effort greatly while obtaining the final schedules of good quality. The experimental results show that the proposed algorithm gives better solutions quickly than the existing heuristic algorithms such as the RHP(Rolling Horizon Procedure) heuristic, the basic tabu search, and simulated annealing.

Keywords

References

  1. Ali, A., Jatinder, N. D. G.and Tariq, A.(1999), A review of scheduling research involving set up considerations, The Internatiol journal of Management Science, 27(2).219-239
  2. Armentano V.A. and Yamashita, D. S.(2000), Tabu search for scheduling on identical parallel machines to minimize mean tardiness, journal of Intelligent Manufacturing, 11(5),453-460
  3. Crauwels, H. A.J. and Potts, C.N. (1998), Local search heuristics for the single machine total weighted tardiness scheduling problem, INFORMS journal on Computing, 10,341-350
  4. Franca, P.M.,Gendreau.M..Laporte, G.and Muller. F.M.(1996),A tabu search heuristic for the multi processor scheduling problem with sequence dependent set up times, International journal of Production Economics. 43(2-3), 79-89
  5. Gendreau, M.. Hertz, A. and Laporte, G. (1992), New insertion and post-optimization procedures for the traveling salesman problem. Operations Research, 40(6). 1086-1094
  6. Glover, F.(1989), Tabu search-Part I, ORSA journal on Computing, 1, 190-206
  7. Glover, F.(1990), Tabu search-Part II, ORSA journal on Computing, 2, 4-32
  8. Guinet, A.(1993), Scheduling sequence-dependent jobs on identical parallel machines to minimize completion rime criteria, International journal of Production &search, 31(7), 1579-1594
  9. Kim, S.Y. and Bobrowski, P.M.(1994), Impact on sequence-dependent setup times on job shop scheduling performance, International journal of Production &search, 32(7), 1503-1520
  10. Laguna, M. and Velarde. J. L. G. (1991), A search heuristic for just-in-time scheduling in parallel machines, journal of Intelligent Manufacturing, 2(4), 253-260
  11. Laguna, M.,Barnes.J. W.and Glover, F. (1991). Tabu search methods for single machine scheduling problem, journal of intelligent Manufacturing, 2(2), 63-74
  12. Lawler, E L., Lensrra.J. K.., Rinnooy Kan, A.H. G. and Shmoys, D. B.(1993), Sequencing and scheduling: algorithms and complexity, in Handbooks in Operations Research and Management Science: Logistics of Production and Inventory, North Holland, 445-522
  13. Lee, Y.H.,Bhaskran, K.and Pinedo, M.(1997), A heuristic to minimize the total weighted tardiness with sequence-dependent setups, IIE Transactions, 29(1), 45-52
  14. Lee, Y. H. and Pinedo, M.(1997), Scheduling jobs on parallel machines with sequence-dependent setup times, European Journal of Operational Research, 100(3),464-474
  15. Matsuo, H.,Sub, c. J. and Sullivan, R S. (1989), A controlled search simulated annealing method for the general job shop scheduling problem, Annals of Operation Research, 21(85-108)
  16. Parker, R G.,Deane, R H. and Holmes. R.A. (1977), On the use of a vehicle routing algorithm for the parallel processor problems with sequence dependent changeover costs, AIIE Transactions, 9(2), 155-160
  17. 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(11), 3173-3192
  18. Uzsoy,R.,http://palette.ecn.purdue.edu/~uzsoy2/Problems/parallellparameters.html
  19. Vakharia, A. J. and Chang, Y.(1990), A simulated annealing approach to scheduling a manufacturing cell, 40, 559-577