A due date density-based categorising heuristic for parallel machines scheduling

International Journal of Advanced Manufacturing Technology

Volumn 22, Issue 9-10, 2003, Pages 753-760

  Kim, S S ^a   Shin, H J ^b   Eom, D H ^a   Kim, C O ^c  

^a Korea University   (South Korea)

^b Texas AandM University   (United States)

^c Yonsei University   (South Korea)

Author keywords

Categorising heuristic; Parallel machines; Scheduling; Total weighted tardiness

Indexed keywords

ALGORITHMS; BATCH DATA PROCESSING; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; COST EFFECTIVENESS; DENSITY MEASUREMENT (SPECIFIC GRAVITY); HEURISTIC METHODS; INTEGER PROGRAMMING; JOB ANALYSIS; LIQUID CRYSTAL DISPLAYS; PARALLEL PROCESSING SYSTEMS; SCHEDULING; THIN FILM TRANSISTORS; TIME AND MOTION STUDY;

TABU SEARCH (TS) METHODS; TOTAL WEIGHT TARDINESS (TWT);

INDUSTRIAL ENGINEERING;

EID: 0346152771     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-003-1611-4     Document Type: Article

References (23)

1. Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice-Hall, Upper Saddle River, NJ
2. Ovacik IM, Uzsoy R (1994) Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence dependent setup times. Int J Prod Res 32:1243-1263
3. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP completeness. WH Freeman, New York
4. Lawler EL (1997) A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness. Annals Discr Math 1:331-342
5. Potts CN, van Wassenhove LN (1982) A decomposition algorithm for the single machine total tardiness problem. Oper Res Lett 1:177-181
6. Vepsalainen A, Morton TE (1987) Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs. Manage Sci 33:1036-1047
7. Dobson G, Nabinadom RS (1992) The batch loading and scheduling problem. Research Report, Simon Graduate School of Business Administration, University of Rochester
8. Uzsoy R (1995) Scheduling batch processing machines with incompatible job families. Int J Prod Res 33:2685-2708
9. Ovacik I, Uzsoy R (1994) Rolling horizon algorithms for a single machine dynamic scheduling problem with sequence dependent setup times. Int J Prod Res 32:1243-1263
10. Schutten JMJ, Leussink RAM (1996) Parallel machine scheduling with release dates, due dates and family setup times. Int J Prod Econ 46-47:119-125
11. Lee YH, Pinedo M (1997) Scheduling jobs on parallel machines with sequence-dependent setup times. Europ J Oper Res 100:464-474
12. Marsh JD, Montgomery DC (1973) Optimal procedures for scheduling jobs with sequence-dependent changeover times on parallel processors. AIIE Tech Pap 279-286
13. Geoffrion AM, Graves GW (1976) Scheduling parallel production lines with changeover costs; practical applications of a quadratic assignment/LP approach. Oper Res 24:595-610
14. Dean RH, White ER (1975) Balancing workloads and minimizing setup costs in the parallel processing shop. Oper Res 26:45-53
15. Elmagraby SE, Park S (1974) Scheduling jobs on a number of identical machines. IIE Trans 6:1-13
16. 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
17. Bitran GR, Gilbert SM (1990) Sequencing production on parallel machines with two magnitudes of sequence-dependent setup cost. J Manufact Oper Manage 3:190-206
18. Ghosh JB (1994) Batch scheduling to minimize total completion time. Oper Res Lett 16:271-275
19. Ali A, Jatinder NDG, Tariq A (1999) A review of scheduling research involving setup considerations. Int J Manage Sci 27:219-239
20. Glover F (1989) Tabu search-part I. ORSA J Comput 1:190-206
21. Glover F (1989) Tabu search-part II. ORSA J Comput 2:4-32
22. Barnes W, Chambers JB (1995) Solving job shop scheduling problems with tabu search. HE Trans 27:257-263
23. James RJW (1997) Using tabu search to solve the common due date early/tardy machine scheduling problem. Comput Oper Res 24(3): 199-208