A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times

International Journal of Advanced Manufacturing Technology

Volumn 19, Issue 11, 2002, Pages 859-866

  Shin, H J ^a   Kim, C O ^b   Kim, S S ^a  

^a Korea University   (South Korea)

^b Yonsei University   (South Korea)

Author keywords

Due dates; Heuristic algorithm; Release times; Scheduling; Sequence dependent set up times; Tabu search

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; ITERATIVE METHODS; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING;

MODIFIED APPARENT TARDINESS COST WITH SET-UPS; ROLLING HORIZON PROCEDURE; SINGLE MACHINE; TABU SEARCH ALGORITHM;

MACHINING;

EID: 0036062266     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001700200097     Document Type: Article

References (17)

1. Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence dependent setup times
2. Sequencing and scheduling: Algorithms and complexity
3. A review of scheduling research involving setup considerations
4. Sequencing with due-dates and early start times to minimize maximum tardiness
5. Scheduling tasks with sequence-dependent processing times
6. Production scheduling algorithms for a semiconductor test facility
7. A hybrid approach to sequencing jobs using heuristic rules and neural networks
8. A heuristic to minimize the total weighted tardiness with sequence-dependent setups
9. Real-time scheduling on an automated machine center
10. Tabu search - Part I
11. Tabu search - Part II
12. Tabu search methods for single machine scheduling problem
13. A tabu search approach for the single-machine mean tardiness problem
14. A neighbourhood with a compressed solution-space for the early/tardy scheduling problem
15. Local search heuristics for the single machine scheduling with batching to minimize the number of late jobs