The effects of work-in-process inventory costs on the design and scheduling of assembly lines with low throughput and high component costs

IIE Transactions (Institute of Industrial Engineers)

Volumn 28, Issue 5, 1996, Pages 405-414

  Rosenblatt, Meir J ^a,b   Lee, Hau L ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b WASHINGTON UNIVERSITY   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY; COSTS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; INVENTORY CONTROL; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PRODUCTION CONTROL; RESOURCE ALLOCATION; SCHEDULING; SYSTEMS ANALYSIS;

ASSEMBLY LINES; BRANCH AND BOUND PROCEDURE; INVENTORY HOLDING COST; WORK IN PROCESS INVENTORY;

OPERATIONS RESEARCH;

EID: 0030148735     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179608966287     Document Type: Article

References (32)

1. Arcus, A.L., (1966) COMSOAL a computer method, of sequencing operations for assembly lines. International Journal of Production Research, 4, 259–277.
2. Baker, K.R., (1974) Introduction to Sequencing and Scheduling, Wiley, New York.
3. Bard, J.F., (1989) Assembly line balancing with parallel work stations and dead time. International Journal of Production Research, 27, 1005–1018.
4. Baybars, I., (1986) A survey of exact algorithms for the simple assembly line balancing problem. Management Science, 32, 909–932.
5. Bowman, E.H., (1960) Assembly line balancing by linear programming. Operations Research, 8, 385–389.
6. Chakravarty, A.K., and Shtub, A., (1986) Dynamic manning of long cycle assembly lines with learning effect. HE Transactions. 18, 392–397.
7. Dar-El, E.M., (1973) MALB-A heuristic technique for balancing large single-model assembly lines. AIIE Transactions, 5, 343–356.
8. Dar-El, E.M., (1975) Solving large single-model assembly line-balancing problems-a comparative study. AIIE Transactions, 7, 302–310.
9. Deckro, R.F., (1989) Balancing cycle time and workstations. HE Transactions, 21, 106–111.
10. Easton, F., Faaland, B., KJastorin, T.D., and Schmitt, T., (1989) Improved network based algorithms for the assembly line balancing. International Journal of Production Research, 27, 1901–1915.
11. Gehrlin, W.V., and Patterson, J.H., (1975) Sequencing for assembly lines with integer task times. Management Science, 21, 1064–1070.
12. Gutjahr, A.L., and Nemhauser, G.L., (1964) An algorithm for the line balancing problem. Management Science, 2, 308–315.
13. Hackman, S.T., Magazine, M.J., and Wee, T.S., (1989) Fast, effective algorithms for simple assembly line balancing problems. Operations Research, 37, 916–924.
14. Haider, S.W., and Moodie, C.L., (1978) An investigation of the use of an interactive computer model for balancing paced assembly lines. Computers and Industrial Engineering, 2, 83–89.
15. Held, M., Karp, R.M., and Shareshian, R., (1963) Assembly line balancing-dynamic programming with precedence constraints. Operations Research, 10, 442–460.
16. Helgeson W.B., and Bimie, D.P., (1961) Assembly line balancing using the ranked positional weight technique. Journal of Industrial Engineering, 12, 394–398.
17. Johnson. R.V., (1983) A branch and bound algorithm for assembly line balancing problems with formulation irregularities. Management Science, 29 (11), 1309–1224.
18. Kilbridge, M.D., and Wester, L., (1961) A heuristic method of assembly line balancing. Journal of Industrial Engineering, 12, 292–298.
19. Mansoor, E.M., (1964) Assembly line balancing-an improvement on the ranked positional weight technique. Journal of Industrial Engineering, 15, 73–77.
20. Mastor, A.A., (1970) An experimental investigation and comparative evaluation of production line balancing techniques. Management Science, 16, 728–746.
21. Moodie, C.L., and Young, H.H., (1965) A heuristic method of assembly line balancing for assumptions of constant and variable work element times. Journal of Industrial Engineering, 16, 23–29.
22. Patterson, J.H., and Albrecht, J.J., (1975) Assembly line balancing zero-one programming with Fibonacci search. Operations Research, 23, 166–172.
23. Pinto, P., Dannenbring, D.G., and Khumawala, B.M., (1975) A branch and bound algorithm for assembly line balancing with paralleling. International Journal of Production Research, 13, 183–196.
24. Pinto, P.A., Dannenbring, D.G., and Khumawala, B.M., (1978) A heuristic network procedure for assembly line balancing. Naval Research Logistic Quarterly, 25, 2, 299–307.
25. Pinto, P.A., Dannenbring, D.G., and Khumawala, B.M., (1983) Assembly line balancing with processing alternatives. Management Science, 27 (7), 817–830.
26. Raouf, A., Tsui, C.L., and El-Sayed, E.A., (1980) A new heuristic approach to assembly line balancing. Computers and Industrial Engineering, 4, 223–234.
27. Rosenblatt, M.J., and Carlson, R.C., (1985) Designing a production line to maximize profit. HE Transactions, 17 (2), 117–122.
28. Rosenblatt, M.J., and Lee, H.L., (1992) The effects of work in process inventory costs on the design and scheduling of assembly lines with low throughput and high component costs. Working Paper, Department of US and EM, Stanford University.
29. Sury, R.J., (1971) Aspects of assembly line balancing. International Journal of Production Research, 9, 501–512.
30. Talbot, F.B., and Patterson, J.H., (1984) An integer programming algorithm with network cuts for solving the assembly line balancing problem. Management Science, 30 (1), 85–99.
31. Talbot, F.B., Patterson, J.H., and Gehrlein, W.V., (1986) A comparative evaluation of heuristic line balancing techniques. Management Science, 32 (4), 430–454
32. Thangavelu, S.R., and Shetty, CM., (1971) Assembly line balancing by zero-one integer programming. AIE Transactions, 3, 61–68.