The Line Segmentation Problem

This paper describes a line segmentation problem in a multistage, multimachine production system. The production facility can concurrently produce several types of circuit boards because each production stage consists of multiple machines. The items produced are categorized into families, and items belonging to the same family share the common major setup, while switching over from one family to another requires a major setup. The line segmentation problem determines an allocation of machines at each production stage to families so as to minimize the time to complete all jobs. As a result of segmenting the line, several minilines are formed which are dedicated to the production of items in each family. Forming dedicated minilines and producing the items in a family on the same line captures the benefits of group technology and focused factory. We first formalize the line segmentation problem as a quadratic integer programming problem, and establish its NP-completeness. Since the problem is NP-complete, we...

[1]  J. Randall Brown,et al.  The Knapsack Sharing Problem , 1979, Oper. Res..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[4]  Stephen E. Jacobsen,et al.  On Marginal Allocation in Single Constraint Min-Max Problems , 1971 .

[5]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..

[6]  Gérard Roucairol,et al.  Multiserialization of Iterated Transactions , 1984, Inf. Process. Lett..

[7]  Leon S. Lasdon,et al.  Generalized Reduced Gradient Software for Linearly and Nonlinearly Constrained Problems , 1978 .

[8]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[9]  Godwin C. Ovuworie,et al.  Mathematical Programming: Structures and Algorithms , 1979 .

[10]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[11]  Leon S. Lasdon,et al.  Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming , 1978, TOMS.

[12]  Awi Federgruen,et al.  The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality , 1986, Oper. Res..

[13]  Joseph El Gomayel,et al.  GROUP TECHNOLOGY AND PRODUCTIVITY , 1986 .

[14]  Errol L. Lloyd,et al.  Concurrent Task Systems , 1981, Oper. Res..

[15]  Philip M. Wolfe,et al.  Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach , 1969 .

[16]  James H. Patterson,et al.  An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems , 1978 .

[17]  Tadao Murata.  Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance , 1980, IEEE Transactions on Software Engineering.

[18]  Nicos Christofides,et al.  An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

[19]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[20]  James H. Patterson,et al.  A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem , 1984 .

[21]  Andrew Chi-Chih Yao,et al.  Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.

[22]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[23]  Christopher Voss.  Just-in-time manufacture , 1987 .

[24]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case , 1970, Oper. Res..

[25]  Edward W. Davis,et al.  A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling , 1975 .

[26]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[27]  Leon S. Lasdon,et al.  OR Practice - The Status of Nonlinear Programming Software: An Update , 1987, Oper. Res..

[28]  David B. Lomet.  Subsystems of Processes with Deadlock Avoidance , 1980, IEEE Transactions on Software Engineering.

[29]  Christopher S. Tang.  A Max-Min Allocation Problem: Its Solutions and Applications , 1988, Oper. Res..

[30]  Dennis W. Leinbaugh.  Selectors: High-Level Resource Schedulers , 1984, IEEE Transactions on Software Engineering.

[31]  J. Randall Brown,et al.  The Sharing Problem , 1979, Oper. Res..