Parallel flowshop scheduling using Tabu search

International Journal of Production Research

Volumn 41, Issue 13, 2003, Pages 3059-3073

  Cao, Dong ^a   Chen, Mingyuan ^a  

^a Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COSTS; HEURISTIC METHODS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PRODUCTION ENGINEERING; SCHEDULING;

TABU SEARCH;

MACHINE SHOPS;

EID: 0242269912     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/0020754031000106443     Document Type: Article

References (19)

1. AZIZOGLU, M. and KIRCA, O., 1999, Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. IIE Transactions, 31, 153-159.
2. CHAN, L. M. A., MURIEL, A. and SIMCHI-LEVI, D., 1998, Parallel machines scheduling, linear programming, and parameter list scheduling heuristics. Operations Research, 46, 729-741.
3. COCHRAN, J. K., HORNG, S. and FOWLER, J. W., 2002, A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Computers and Operations Research (in press).
4. GAREY, M. and JOHNSON, D., 1978, Strong NP-completeness results: motivation, examples and implications. Journal of ACM, 25, 499-508.
5. GEN, M. and CHENG, R., 1996, Genetic Algorithms and Engineering Design (New York: Wiley).
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. GLOVER, F. and LAGUNA, M., 1997, Tabu Search (Dordrecht: Kluwer).
9. HIRAISHI, K., LEVNER, E. and VLACH, M., 2002, Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Computers and Operations Research, 29, 841-848.
10. JOHNSON, S., 1954, Optimal two and three stage production schedules with set-up times included. Naval Research Logistics Quarterly, 1, 61-68.
11. MORTON, T. E. and PENTICO, D. W., 1993, Heuristic Scheduling Systems: With Applications to Production Systems and Project Management (New York: Wiley).
12. PIRLOT, M., 1996, General local search methods. European Journal of Operational Research, 92, 493-511.
13. RADHAKRISHNAN, S. and VENTURA, J. A., 2000, Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times. International Journal of Production Research, 38, 2233-2252.
14. SALHI, S., 2002, Defining Tabu list size and aspiration criterion with Tabu search methods. Computers and Operations Research, 29, 67-86.
15. SARIN, S. C., AHN, S. and BISHOP, A., 1988, An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime. International Journal of Production Research, 26, 1183-1191.
16. SINGH, N., 1996, Systems Approach to Computer-Integrated Design and Manufacturing (New York: Wiley).
17. SIVRIKAYA-SERIFOGLU, F. and ULUSOY, G., 1999, Parallel machine scheduling with earliness and tardiness penalties. Computers and Operations Research, 26, 773-787.
18. T'KINDT, V., GUPTA, J. and BILLAUT, J. C., 2003, Two-machine flowshop scheduling with a secondary criterion. Computers and Operations Research, 30, 505-526.
19. WEBSTER, S. and BAKER, K. R., 1995, Scheduling groups of jobs on a single machines. Operations Research, 43, 692-703.