An efficient tabu search approach for the two-machine preemptive open shop scheduling problem

Computers and Operations Research

Volumn 30, Issue 14, 2003, Pages 2081-2095

  Liaw, Ching Fang ^a  

^a CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Open shop; Scheduling; Tabu search; Tardiness

Indexed keywords

ALGORITHMS; CALCULATIONS; SCHEDULING;

TABU SEARCH (TS);

JOB ANALYSIS;

ALGORITHM; PRODUCTION SYSTEM;

EID: 0042388573     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00124-7     Document Type: Article

References (31)

1. Brucker P. Scheduling algorithms. Berlin Heidelberg: Springer, 1995.
2. Pinedo M. Scheduling: theory, algorithms, and systems. Englewood Cliffs, NJ: Prentice Hall, 1995.
3. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 1979;5:287-326.
4. Du J, Leung JY-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 1990;15:483-95.
5. Achugbue JO, Chin FY. Scheduling the open shop to minimize mean flow time. SIAM Journal on Computing 1982;11:709-20.
6. Brasel H, Tautenhahn T, Werner F. Constructive heuristic algorithms for the open shop problem. Computing 1993;51:95-110.
7. Brucker P, Hurink J, Jurish B, Wostmann B. A branch and bound algorithm for the open-shop problem. Discrete Applied Mathematics 1997;76:43-59.
8. Gueret C, Prins C. Classical and new heuristics for the open-shop problem. European Journal of Operational Research 1998;107(2):306-14.
9. Liaw CF. A hybrid genetic algorithm for the open shop scheduling problem. European Journal of Operational Research 2000;124(1):28-42.
10. Gonzalez T, Sahni S. Open shop scheduling to minimize finish time. Journal of the Association for Computing Machinery 1976;23(4):665-79.
11. Gonzalez T. A note on open shop preemptive schedules. IEEE Transactions on Computers 1979;C-28:782-6.
12. Cho Y, Sahni S. Preemptive scheduling of independent jobs with release and due times on open, flow and job shops. Operations Research 1981;29:511-22.
13. Lawler EL, Lenstra JK, Rinnooy Kan AHG. Minimizing maximum lateness in a two-machine open shop. Mathematics of Operations Research 1981;6:153-8.
14. Liu CY, Bulfin RL. On the complexity of preemptive open shop scheduling problem. Operations Research Letters 1985;4:71-4.
15. Liu CY, Bulfin RL. Scheduling ordered open shops. Computers and Operations Research 1987;14(3):257-64.
16. Liu CY. A branch-and-bound algorithm for the preemptive open shop scheduling problem. Journal of the Chinese Institute of Industrial Engineers 1995;12(1):25-31.
17. Liaw CF. Scheduling preemptive open shops to minimize total tardiness. European Journal of Operational Research, 2001, in review.
18. Sriskandarajah C, Wagneur E. On the complexity of preemptive openshop scheduling problems. European Journal of Operational Research 1994;77:404-14.
19. Baker KR, Bertrand J. A dynamic priority rule for scheduling against due-dates. Journal of Operations Management 1982;3:37-42.
20. Glover F. Future paths for integer programming and linkage to artificial intelligence. Computers and Operations Research 1986;13:533-49.
21. Glover F. Tabu search-Part I. ORSA Journal on Computing 1989;1:190-206.
22. Glover F. Tabu search-Part II. ORSA Journal on Computing 1990;2:4-32.
23. Glover F, Laguna M. Tabu search. Dordrecht: Kluwer Academic Publishers, 1997.
24. Rayward-Smith VJ, Osman IH, Reeves CR, Smith GD, editors. Modern heuristic search methods. Chichester: Wiley, 1996.
25. Reeves CR, editor. Modern heuristic techniques for combinatorial problems. Oxford: Blackwell Scientific Publications, 1993.
26. Chakrapani J, Skorin-Kapov J. Massively parallel tabu search for quadratic assignment problem. Annals of Operations Research 1993;41:327-41.
27. Dell'Amico M, Trubian M. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research 1993;41:231-52.
28. Taillard E. Robust taboo search for the quadratic assignment problem. Parallel Computing 1991;17:443-55.
29. Xu J, Chiu SY, Glover F. Fine-tuning a tabu search algorithm with statistical tests. International Transactions on Operational Research 1998;5(3):233-44.
30. Lageweg BJ, Lenstra JK, Rinnooy Kan AHG. A general bounding scheme for the permutation flow-shop problem. Operations Research 1978;26:53-67.
31. Fisher ML. A dual algorithm for the one machine scheduling problem. Mathematical Programming 1976;11:229-51.