Dynamic programming solution to the batching problem in just-in-time flow-shops

Computers and Industrial Engineering

Volumn 51, Issue 3, 2006, Pages 416-432

  Yavuz, Mesut ^a   Tufekci, Suleyman ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Dynamic programming; Flow shop; Just in time; NP hard; Production smoothing

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER AIDED MANUFACTURING; DYNAMIC PROGRAMMING; PROBLEM SOLVING;

JUST IN TIME FLOW SHOPS; MIXED MODEL MANUFACTURING SYSTEMS; PRODUCTION SMOOTHING;

JUST IN TIME PRODUCTION;

EID: 33750699292     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2006.08.005     Document Type: Article

References (30)

1. Aigbedo H. Some structural properties for the just-in-time level schedule problem. Production Planning and Control 11 4 (2000) 357-362
2. Balas E., Miller D., Pekny J., and Toth P. A parallel shortest augmenting path algorithm for the assignment problem. Journal of the ACM 38 4 (1991) 985-1004
3. Chakravarty A.K., and Shtub A. Balancing mixed model lines with in-process inventories. Management Science 31 9 (1985) 1161-1174
4. Cheng L., and Ding F. Modifying mixed-model assembly line sequencing methods to consider weighted variations for just-in-time production systems. IIE Transactions 28 (1996) 919-927
5. Ding F., and Cheng L. A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems. Operations Research Letters 13 (1993) 27-36
6. Garey M., and Johnson D. Computers and intractability: A guide to the theory of NP-completeness (1979), W. H. Freeman and Company, New York
7. Inman R., and Bulfin R. Sequencing JIT mixed-model assembly lines. Management Science 37 7 (1991) 901-904
8. Kubiak W. Minimizing variation of production rates in just-in-time systems: a survey. European Journal of Operational Research 66 (1993) 259-271
9. Kubiak W., and Sethi S. A note on level schedules for mixed-model assembly lines in just-in-time production systems. Management Science 37 1 (1991) 121-122
10. Lummus R. A simulation analysis of sequencing alternatives for JIT lines using kanbans. Journal of Operations Management 13 (1995) 183-191
11. Macaskill J.L.C. Production-line balances for mixed-model lines. Management Science 19 4 (1972) 423-434
12. Mansouri S. A multi-objective genetic algorithm for mixed-model sequencing on JIT lines. European Journal of Operational Research 167 (2005) 696-716
13. McMullen P. JIT sequencing for mixed-model assembly lines with setups using tabu search. Production Planning and Control 9 5 (1998) 504-510
14. McMullen P. An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives. Artificial Inteligence in Engineering 15 (2001) 309-317
15. McMullen P. An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics. Computers and Industrial Engineering 41 (2001) 335-353
16. McMullen P. A kohonen self-organizing map approach to addressing a multiple objective, mixed-model JIT sequencing problem. International Journal of Production Economics 72 (2001) 59-71
17. McMullen P. The permutation flow shop problem with just in time production considerations. Production Planning and Control 13 3 (2002) 307-316
18. McMullen P., and Frazier G. A simulated annealing approach to mixed-model sequencing with multiple objectives on a just-in-time line. IIE Transactions 32 (2000) 679-686
19. McMullen P., and Tarasewich P. A beam search heuristic mixed-model scheduling with setups. International Journal of Production Economics 96 (2005) 273-283
20. McMullen P., Tarasewich P., and Frazier G. Using genetic algorithms to solve the multi-product JIT sequencing problem with set-ups. International Journal of Production Research 38 12 (2000) 2653-2670
21. Mendes A., Ramos A., Simaria A., and Vilarinho P. Combining heuristic procedures and simulation models for balancing a PC camera assembly line. Computers and Industrial Engineering 49 (2005) 413-431
22. Miltenburg J. Level schedules for mixed-model assembly lines in just-in-time production systems. Management Science 35 2 (1989) 192-207
23. Miltenburg J., Steiner G., and Yeomans S. A dynamic programming algorithm for scheduling mixed-model just-in-time production systems. Mathematical and Computer Modeling 13 3 (1990) 57-66
24. Monden Y. Toyota Production System: An Integrated Approach to Just-In-Time. 3rd ed. (1998), Engineering and Management Press, USA
25. Pinedo M. Scheduling: Theory algorithms and systems. 2nd ed. (2001), Prentice Hall, USA
26. Steiner G., and Yeomans S. Level schedules for mixed-model, just-in-time processes. Management Science 39 6 (1993) 728-735
27. Thomopoulos N.T. Line balancing-sequencing for mixed-model assembly. Management science 14 2 (1967) B59-B75
28. Thomopoulos N.T. Mixed model line balancing with smoothed station assignments. Management Science 16 9 (1970) 593-603
29. Yavuz M., and Tufekci S. The single-level batch production smoothing problem: An analysis and a heuristic solution. Technical Report 05, Department of Industrial and Systems Engineering (2004), University of Florida, Gainesville, FL
30. Yavuz, M., & Tufekci, S. (2004b). Some lower bounds on the mixed-model level-scheduling problems. In: Proceedings of the 10th International Conference on Industry, Engineering and Management Systems, pp. 385-395.