Integrating the lot-sizing and sequencing decisions for scheduling a capacitated flow line

Computers and Industrial Engineering

Volumn 30, Issue 4, 1996, Pages 659-679

  Sikora, Riyaz ^a   Chhajed, Dilip ^b   Shaw, Michael J ^b  

^a UNIVERSITY OF MICHIGAN DEARBORN   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DECISION THEORY; HEURISTIC METHODS; OPTIMIZATION; PERFORMANCE; SCHEDULING; SURFACE MOUNT TECHNOLOGY;

CAPACITATED FLOW LINE; INVENTORY HOLDING COSTS; LOT SIZING; SEQUENCING DECISIONS; SILVER MEAL HEURISTIC;

COMPUTER INTEGRATED MANUFACTURING;

EID: 0030241757     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/0360-8352(96)00183-0     Document Type: Article

References (31)

1. H. C. Bahl and L. P. Ritzman. A cyclical scheduling heuristic for lot sizing with capacity constraints. Int. J. Prod. Res. 22, 791-800 (1984).
2. H. C. Bahl, L. P. Ritzman and J. N. D. Gupta. Determining lot sizes and resource requirements: a review. Opns Res. 35, 329-345 (1987).
3. H. Singh and J. B. Foster. Production scheduling with sequence dependent setup costs. IIE Trans. 43-49 (1987).
4. D. M. Dilts and K. D. Ramsing. Joint lot sizing and scheduling of multiple items with sequence-dependent setup costs. Decis. Sci. 20, 120-133 (1989).
5. A. S. Manne. Programming of economic lot sizes. Mgmt Sci. 4, 125-135 (1958).
6. B. Dzielinski and R. Gomory. Optimal programming of lot sizes, inventories, and labor allocations. Mgmt Sci. 7, 874-890 (1965).
7. L. S. Lasdon and R. C. Turjung. An efficient algorithm for multi-item scheduling. Opns Res. 19, 946-969 (1971).
8. S. E. Elmaghraby. On heuristics and their performance evaluation for dynamic lot sizing. Mgmt Sci. 26, 1-10 (1989).
9. E. A. Silver and H. C. Meal. A heuristic selecting lot size requirement for the case of a deterministic time varying demand rate and discrete opportunities for replenishment. Prod. Invent. Mgmt 14, 64-74 (1973).
10. G. R. Bitran, T. L. Magnanti and H. H. Yanasse. Approximation methods for the uncapacitated dynamic lot size problem. Mgmt Sci. 31, 1121-1140 (1984).
11. J. J. DeMatteis and A. G. Mendoza. An economic lot sizing technique. IBM Syst. J. 7, 30-46 (1968).
12. R. Peterson and E. A. Silver. Decision System for Inventory Management and Production Planning. Wiley, New York (1979).
13. D. S. Palmer. Sequencing jobs through a multistage process in the minimum total time - a quick method of obtaining a near optimum. Opns Res. Q. 16, 101-107 (1965).
14. J. N. D. Gupta. A functional heuristic algorithm for the flow-shop scheduling problem. Opns Res. 22(11) 39-48 (1971).
15. H. G. Campbell, R. A. Dudek and M. L. Smith. A heuristic algorithm of the n job, m machine sequencing problem. Mgmt Sci. 16, B630-B637 (1970).
16. S. M. Johnson. Optimal two-and three-stage production schedules with set-up times included. Nav. Res. Logist. Q. 1, 61-68 (1954).
17. J. N. D. Gupta. Flowshop schedules with sequence dependent setup times. J. Opns Res. Soc. Japan 29, 206-219 (1986).
18. V. L. Smith-Daniels and L. P. Ritzman. A model for lot sizing and sequencing in process industries. Int. J. Prod. Res. 26, 647-674 (1988).
19. F. Glover. Tabu search: a tutorial - a heuristic procedure for solving optimization problems explained. Interfaces 20, No. 4, 74-94 (1990).
20. T. J. Sawik. Multilevel scheduling of multistage production with limited in-process inventory. J. Opl Res. Soc. 38, 651-664 (1987).
21. C. N. Potts and L. N. Wassenhove. Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J. Opl Res. Soc. 43, 395-406 (1992).
22. K. R. Baker. Introduction to Sequencing and Scheduling. Wiley, New York (1974).
23. S. C. Graves. A review of production scheduling. Opns Res. 29 (1981).
24. D. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA (1989).
25. P. J. M. Laarhoven and E. H. L. Aarts. Simulated Annealing: Theory and Applications. Reidel (1987).
26. S. Lin and B. W. Kernighan. An efficient heuristic algorithm for the travelling salesman problem. Opns Res. 21, 498-516 (1973).
27. M. Hamburg. Statistical Analysis for Decision Making, 2nd edition. Harcourt Brace Jovanovich (1977).
28. J. Adams, E. Balas and D. Zawack. The shifting bottleneck procedure of for job shop scheduling. Mgmt Sci. 34, 391-401 (1988).
29. O. A. Aras and L. A. Swanson. A lot sizing and sequencing algorithm for dynamic demands upon a single facility. J. Opns Mgmt 2, 177-185 (1982).
30. T. Morton. Heuristic scheduling systems with application to production systems and project management (1992).
31. R. Nakano and T. Yamada. Conventional genetic algorithm for job shop problems. In Proceedings of the Fourth International Conference on Genetic Algorithms and their Applications, San Diego, CA, pp. 474-479 (1991).