Balancing U-lines in a multiple U-line facility

European Journal of Operational Research

Volumn 109, Issue 1, 1998, Pages 1-23

  Miltenburg, John ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

Dynamic programming; Facility design; Just in time production systems; Line balancing; Manufacturing

Indexed keywords

EID: 0002134614     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00169-0     Document Type: Article

References (19)

1. Baybars, I., 1986. A survey of exact algorithms for the simple assembly line balancing problem. Management Science 32, 909-932.
2. Hackman, ST., Magazine, M.J., Wee, T.S., 1989. Fast, effective algorithms for simple assembly line balancing problems. Operations Research 37 (6), 916-924.
3. Hall, R.W., 1983. Zero Inventories, Dow Jones, Irwin, Homewood, Illinois.
4. Hoffmann, T.R., 1992. Eureka: A hybrid system for assembly line balancing. Management Science 8 (1), 39-47.
5. Japan Management Association, Canon Production System, Productivity Press, Portland, OR, USA, 1987.
6. Johnson, R.V., 1981. Assembly line balancing algorithms: Computational comparisons. International Journal of Production Research 19, 277-287.
7. Johnson, R.V., 1988. Optimally balancing large assembly lines with 'Fable'. Management Science 34 (1), 240-253.
8. Lawler, E.L., 1979. Efficient implementation of dynamic programming algorithms for sequencing problems, Report BW 106/79, Stichting Mathematish Centrum, 2e Boerhaavestraat 49, Amsterdam.
9. Miltenburg, G.J., Wijngaard, J., 1994. The U-line balancing problem. Management Science 40 (10), 1378-1388.
10. Miltenburg G.J., Sparling, D.H., 1994a. Optimal solution algorithms for the U-line balancing problem, Working paper, McMaster University, Hamilton, Ontario.
11. Miltenburg G.J., Sparling, D.H., 1994b. An extension of the U-line balancing problem: Travel times and pairs of U-lines, Working paper, McMaster University, Hamilton, Ontario.
12. Monden, Y., 1993. Toyota Production System, 2nd edition, Industrial Engineering Press, Institute of Industrial Engineers, Norcross, GA.
13. Provan, J.S., Ball, M.O., 1983. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal of Computing 12, 777-788.
14. Schonberger, R.J., 1982. Japanese Manufacturing Techniques: Nine Hidden Lessons in Simplicity, The Free Press, New York.
15. Shimbum, N.K., 1991. The Factory Management Notebook Series: Case Studies in Improvement, Mixed-Model Production, Productivity Press, Portland, OR, USA.
16. Steiner, G., 1990. On the complexity of dynamic programming for sequencing problems with precedence constraints. Annals of Operations Research 26, 103-123.
17. Talbot, F.B., Patterson, J.H., 1984. An integer programming algorithm with network cuts for solving the assembly line balancing problem. Management Science 30 (1), 85-99.
18. Talbot, F.B., Patterson, J.H., Gehrlein, W.V., 1986. A comparative evaluation of heuristic line balancing techniques. Management Science 32 (4), 430-454.
19. Wantuck, K.A., 1989. Just In Time for America, The Forum Ltd., Milwaukee, WI.