The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops

International Journal of Production Research

Volumn 37, Issue 10, 1999, Pages 2253-2270

  Ouenniche, J ^a   Boctor, F F ^a   Martel, A ^a  

^a UNIVERSITÉ LAVAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COSTS; DECISION THEORY; HEURISTIC PROGRAMMING; MATHEMATICAL PROGRAMMING; SCHEDULING;

FLOW SHOPS; LOT SIZING; SEQUENCING DECISIONS;

PRODUCT DEVELOPMENT;

EID: 0032651376     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499190752     Document Type: Article

References (16)

1. Campbell, H. G., Dudek, R. A, and Smith, M. L., 1970, A heuristic algorithm for the n job, m machine sequencing problem. Management Science, 16, 630-637.
2. Conover, W. J., 1980, Practical Nonparametric Statistics (New York: Wiley).
3. Bazaraa, M. S. and Shetty, C. M., 1979, Nonlinear Programming: Theory and Algorithms John (Wiley).
4. Dannenbring, D. G., 1977, An evaluation of flow shop sequencing heuristics. Management Science, 23, 1174-1182.
5. Dobson, G. and Yano, C. A., 1994, Cyclic scheduling to minimize inventory in a batch flow line. European Journal of Operational Research, 75, 441-461.
6. El-Najdawi, M. K. and Kleindorder, P. R., 1993, Common cycle lot-size scheduling for multi-product, multi-stage production. Management Science, 39, 872-885.
7. El-Najdawi, M. K., 1994, A job-splitting heuristic for lot-size scheduling in multi-stage, multi-product production processes. European Journal of Operational Research, 75, 365-377.
8. Gelders, L. F. and Sambandam, N., 1978, Four simple heuristics for scheduling a flowshop. International Journal of Production Research, 16, 221-231.
9. Hsu, J. I. S, and El-Najdawi, M., 1990, Common cycle scheduling in a multistage production process. Engineering Costs and Production Economics, 20, 73-80.
10. Nawaz, M., Enscore, E. E. and Ham, I., 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11, 91-95.
11. max flowshop problem. Computers and Operations Research, 17, 243-253.
12. Osman, I. H, and Potts, C. N., 1989, Simulated annealing for permutation flow shop scheduling. Omega, 17, 551-557.
13. Palmer, D. S., 1965, Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Operational Research Quarterly, 16, 101-107.
14. Proust, C., Gupta, J. N. D. and Deschamps, V., 1991, Flowshop scheduling with setup, processing and removal times separated. International Journal of Production Research, 29, 479-483.
15. Taillard, E., 1990, Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47, 65-74.
16. Widmer, M. and Hertz, A., 1989, A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research, 41, 186-193.