Sequencing, lot sizing and scheduling of several products in job shops: The common cycle approach

International Journal of Production Research

Volumn 36, Issue 4, 1998, Pages 1125-1140

  Ouenniche, J ^a   Boctor, F ^a  

^a Centre de service   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; NONLINEAR PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

SIMULATED ANNEALING ALGORITHM; TABU SEARCH ALGORITHM;

PRODUCTION;

EID: 0032050798     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075498193552     Document Type: Article

References (15)

1. Adams, J., Balas, E., and Zawack, D., 1988, The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391-401.
2. Anderson, E. J., and Nyirenda, J. C., 1990, Two new rules to minimize tardiness in a job shop. International Journal of Production Research, 28 (12), 2277-2292.
3. Baker, K. R., 1984, Sequencing rules and due-date assignments in a job shop. Management Science, 30 (9), 1093-1104.
4. Blackstone, J. H., Phillips, D. T., and Hogg, G. L., 1982, A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20 (1), 27-45.
5. Carlier, J., and Pinson, E., 1989, An algorithm for solving the job-shop problem. Management Science, 35, 164-176.
6. Cplex Optimization Inc., 1993, Using the CP LEX Callable Library and CP LEX Mixed Integer Library.
7. Dowsland, K. A., 1993, Simulated annealing, in Modern Heuristic Techniques for Combinatorial Problems in C. R. Reeves (ed.) (Oxford: Blackwell Scientific Publications).
8. Eglese, R. W., 1990, Simulated annealing: a tool for operational research. European Journal of Operational Research, 46, 271-281.
9. Glover, F., and Laguna, M., 1993, Tabu Search, in Modern Heuristic Techniques for Combinatorial Problems in C. R. Reeves (ed.) (Oxford: Blackwell Scientific Publications).
10. Hertz, A., Taillard, E., and De Werra, D., 1992, Tabu Search ORWP 92/18 (Lausanne: Ecole Polytechnique Federale de Lausanne).
11. Lageweg, B. J., Lenstra, J. K., and RinnooyKan, A. H. G., 1977, Job-shop scheduling by implicit enumeration. Management Science, 24, 441-450.
12. Taillard, A., 1991, Robust taboo search for the quadratic assignment problem. Parallel Computing, 17, 433-445.
13. Van Laarhoven, P. J. M., and Aarts, E. H. L., 1988, Simulated Annealing: Theory and Applications (Dordrecht: Kluwer).
14. Van Laarhoven, P. J. M., Aarts, E. H. L., and Lenstra, J. K., 1992, Job shop scheduling by simulated annealing. Operations Research, 40 (1), 113-125.
15. Vepsalainen, A. P. J., and Morton, T. E., 1987, Priority rules for job shops with weighted tardiness costs. Management Science, 38 (8), 1035-1047.