Scheduling jobs on parallel machines: A restricted tabu search approach

International Journal of Advanced Manufacturing Technology

Volumn 22, Issue 3-4, 2003, Pages 278-287

  Kim, Chang Ouk ^a   Shin, Hyun Joon ^b  

^a Yonsei University   (South Korea)

^b Texas AandM University   (United States)

Author keywords

Non identical machines; Parallel machine scheduling; Release times; Sequence dependent setup times; Tabu search

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PRODUCTION CONTROL; SCHEDULING;

NONIDENTICAL MACHINES; PARALLEL MACHINES; SEQUENCE DEPENDENT SETUP TIMES; TABU SEARCH;

OPERATIONS RESEARCH;

EID: 0142216509     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-002-1472-2     Document Type: Article

References (18)

1. Kim SC, Bobrowski PM (1994) Impact onsequence-dependent setup time on job shop scheduling performance. Int J Prod Res 32:1503-1520
2. Demirkol E, Uzsoy R (2000) Decomposition methods for reentrant flow shops with sequence-dependent setup times. J Sched 3:155-177
3. Ovacik IM, Uzsoy R (1995) Rolling horizon procedures for dynamic parallel machine scheduling with sequence dependent setup times. Int J Prod Res 33:3173-3192
4. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: algorithms and complexity. In: Handbooks in Operations Research and Management Science: Logistics of Production and Inventory, North Holland, Amsterdam, pp 445-522
5. Shin HJ, Kim CO, Kim SS (2002) A tabu search algorithm for a single machine scheduling with release times, due dates, and sequence-dependent setup times Int J Adv Manufact Technol 19:(11)859-866
6. Ali A, Jatinder NDG, Tariq A (1999) A review of scheduling research involving setup considerations. Omega 27:219-239
7. Parker RG, Deane RH, Holmes RA (1977) On the use of a vehicle routing algorithm for the parallel processor problems with sequence dependent changeover costs. AIIE Transact 9:155-160
8. Franca PM, Gendreau M, Laporte G, Muller FM (1996) A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. Int J Prod Econ 43:79-89
9. Gendreau M, Hertz A, Laporte G (1992) New insertion and post-optimization procedures for the traveling salesman problem. Oper Res 40:1086-1094
10. Guinet A (1993) Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. Int J Prod Res 31:1579-1594
11. Lee YH, Pinedo M (1997) Scheduling jobs on parallel machines with sequence-dependent setup times. Eur J Oper Res 100:464-474
12. Glover F (1989) Tabu search-Part I. ORSA J Comput 1:190-206
13. Glover F (1990) Tabu search-Part II. ORSA J Comput 2:4-32
14. Laguna M, Barnes JW, Glover F (1991) Tabu search methods for single machine scheduling problems. J Intellig Manufact 2:63-74
15. Armentano VA, Yamashita DS (2000) Tabu search for scheduling on identical parallel machines to minimize mean tardiness. J Intellig Manufact 11:453-460
16. Crauwels HAJ, Potts CN, Wassenhove LNV (1996) Local search heuristics for the single machine scheduling with batching to minimize the number of late jobs. Eur J Oper Res 90:200-213
17. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671-680
18. Uzsoy R (1998) Parallel machine problems. machine scheduling problem data sets. http://palette.ecn.purdue/edu/~uzsoy2/Problems/parallel/parameters.html. Cited 3 April 1998