Connections between cutting-pattern sequencing, VLSI design, and flexible machines

The minimization of open stacks problem (MOSP) arises on the sequencing of a set of cutting patterns in order to minimize the maximum number of open stacks around the cutting saw. A previous study formulated the problem mathematically and raised a number of theoretical conjectures. In this work we deal with those conjectures. It is shown that the MOSP is NP-hard. A connection to the field of VLSI design, joining practitioners from both computer science and operations research, is established. Additional conjectures concerning the existence of simultaneous optimal solutions to related pattern-sequencing problems are also clarified.

[1]  Frits C. R. Spieksma,et al.  Minimizing the number of tool switches on a flexible machine , 1994 .

[2]  Oli B.G. Madsen.  An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry , 1988 .

[3]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[4]  D. M. Deighton,et al.  Computers in Operations Research , 1977, Aust. Comput. J..

[5]  Fedor V. Fomin,et al.  Helicopter Search Problems, Bandwidth and Pathwidth , 1998, Discret. Appl. Math..

[6]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[7]  Christopher S. Tang,et al.  Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches , 1988, Oper. Res..

[8]  C. A. Bentivoglio,et al.  Heuristic and exact methods for the cutting sequencing problem , 1998, Eur. J. Oper. Res..

[9]  Christos H. Papadimitriou,et al.  Interval graphs and seatching , 1985, Discret. Math..

[10]  Gerhard Wäscher,et al.  Simulated annealing for order spread minimization in sequencing cutting patterns , 1998, Eur. J. Oper. Res..

[11]  Rolf H. Möhring,et al.  Graph Problems Related to Gate Matrix Layout and PLA Folding , 1990 .

[12]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[13]  Stefan Voß,et al.  Applications of modern heuristic search methods to pattern sequencing problems , 1999, Comput. Oper. Res..

[14]  E. Kuh,et al.  One-dimensional logic gate assignment and interval graphs , 1979, COMPSAC.

[15]  Michael R. Fellows,et al.  Nonconstructive Advances in Polynomial-Time Complexity , 1987, Inf. Process. Lett..

[16]  Horacio Hideki Yanasse,et al.  Linear gate assignment: a fast statistical mechanics approach , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Rui Wang,et al.  Gate Matrix Layout , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[18]  Michael A. Langston,et al.  Exact and Approximate Solutions for the Gate Matrix Layout Problem , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  Zsolt Tuza,et al.  Narrowness, pathwidth, and their application in natural language processing , 1992, Discret. Appl. Math..

[20]  J. Bard.  A Heuristic for Minimizing the Number of Tool Switches on a Flexible Machine , 1988 .

[21]  Yu Hen Hu,et al.  GM Plan: a gate matrix layout algorithm based on artificial intelligence planning techniques , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[22]  Michael R. Fellows,et al.  Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.

[23]  Thomas Lengauer.  Black-white pebbles and graph separation , 2004, Acta Informatica.

[24]  Nancy G. Kinnersley,et al.  The Vertex Separation Number of a Graph equals its Path-Width , 1992, Inf. Process. Lett..

[25]  Michel Gourgand,et al.  A new heuristic based on a hypergraph representation for the tool switching problem , 2000 .

[26]  Horacio Hideki Yanasse.  On a pattern sequencing problem to minimize the maximum number of open stacks , 1997, Eur. J. Oper. Res..

[27]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..

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

[29]  G Frizelle,et al.  Minimizing the number of tool switches on a flexible machine: An experimental study , 2001 .