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

This paper considers a class of assembly systems with long cycle times (low volume of output) and highly expensive components or subassemblies. Systems such as these are typical for companies in the aerospace industry assembling missiles and airplanes. As each unit of the product moves along the assembly line, its value increases owing to additional parts or components installed and the additional work performed. We show that sequencing activities according to ascending values of the ratios of the ‘value added’ to activity duration minimizes inventory holding cost within a given workstation. A branch-and-bound procedure is then used to allocate activities optimally to a given number of workstations. The objective function used in this paper is to maximize the net profit of a production line, which comprises net revenues minus inventory holding costs and fixed costs of workstations. The design of the assembly line is affected by two decision variables: number of workstations and cycle time. Finally, it is ...

[1]  George L. Nemhauser,et al.  An Algorithm for the Line Balancing Problem , 1964 .

[2]  Colin L. Moodie,et al.  An investigation of the use of an interactive computer mode for balancing paced assembly lines , 1978 .

[3]  A. Raouf,et al.  A new heuristic approach to assembly line balancing , 1980 .

[4]  Ilker Baybars,et al.  A survey of exact algorithms for the simple assembly line balancing , 1986 .

[5]  Ezey M. Dar-El,et al.  Solving Large Single-Model Assembly Line Balancing Problems—A Comparative Study , 1975 .

[6]  William V. Gehrlein,et al.  Sequencing for Assembly Lines with Integer Task Times , 1975 .

[7]  Frederick Easton,et al.  Improved network based algorithms for the assembly line balancing problem , 1989 .

[8]  C. M. Shetty,et al.  Assembly Line Balancing by Zero-One Integer Programming , 1971 .

[9]  James H. Patterson,et al.  An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem , 1984 .

[10]  Steven T. Hackman,et al.  Fast, Effective Algorithms for Simple Assembly Line Balancing Problems , 1989, Oper. Res..

[11]  E. H. Bowman Assembly-Line Balancing by Linear Programming , 1960 .

[12]  Avraham Shtub,et al.  TECHNICAL NOTE: Dynamic Manning of Long Cycle Assembly Lines With Learning Effect , 1986 .

[13]  Roger V. Johnson,et al.  A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities , 1983 .

[14]  Ezey M. Dar-El,et al.  MALB—A Heuristic Technique for Balancing Large Single-Model Assembly Lines , 1973 .

[15]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[16]  A. L. Arcus,et al.  COMSOAL: a computer method of sequencing operations for assembly lines , 1965 .

[17]  Richard F. Deckro,et al.  Balancing Cycle Time and Workstations , 1989 .

[18]  A. A. Mastor,et al.  An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques , 1970 .

[19]  Peter A. Pinto,et al.  A heuristic network procedure for the assembly line balancing problem , 1978 .

[20]  R. C. Carlson,et al.  Designing a Production Line to Maximize Profit , 1985 .

[21]  R. J. Sury,et al.  Aspects of assembly line balancing , 1971 .

[22]  Jonathan F. Bard,et al.  Assembly line balancing with parallel workstations and dead time , 1989 .

[23]  William V. Gehrlein,et al.  A comparative evaluation of heuristic line balancing techniques , 1986 .

[24]  Basheer M. Khumawala,et al.  A branch and bound algorithm for assembly line balancing with paralleling , 1975 .

[25]  Peter A. Pinto,et al.  Assembly Line Balancing with Processing Alternatives: An Application , 1983 .

[26]  James H. Patterson,et al.  Technical Note - Assembly-Line Balancing: Zero-One Programming with Fibonacci Search , 1975, Oper. Res..

[27]  M. Held,et al.  Assembly-Line Balancing---Dynamic Programming with Precedence Constraints , 1963 .