Cutting stock with no three parts per pattern: Work-in-process and pattern minimization

Discrete Optimization

Volumn 8, Issue 2, 2011, Pages 315-332

  Aloisio, Alessandro ^a   Arbib, Claudio ^a   Marinelli, Fabrizio ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

Author keywords

Cutting stock; Open stack minimization; Pattern minimization; Set packing

Indexed keywords

CUTTING PATTERNS; CUTTING STOCK; CUTTING STOCK PROBLEM; EXACT SOLUTION; LOWER BOUNDS; MINIMIZATION PROBLEMS; OPEN STACK MINIMIZATION; OPTIMAL SOLUTIONS; PATTERN MINIMIZATION; POLYNOMIAL-TIME; SET PACKING; UNDIRECTED GRAPH; WORK-IN-PROCESS;

CUTTING; POLYNOMIAL APPROXIMATION;

OPTIMIZATION;

EID: 79955591510     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2010.10.002     Document Type: Article

References (21)

1. H. Dyckhoff, G. Scheithauer, J. Terno, Cutting and packing: an annotated bibliography, ibl@ibl.RWTH-aachen.de, 1996.
2. F. Vanderbeck Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem Operations Research 48 2000 915 926 (Pubitemid 32189514)
3. C. Arbib, M. Flammini, and F. Marinelli Minimum flow time graph ordering Proc. of the WG'02: Graph Theoretic Concepts in Computer Science Lecture Notes in Computer Science vol. 2880 2003 Springer-Verlag 23 33
4. G. Belov, and G. Scheithauer Setup and open-stacks minimization in one-dimensional stock cutting INFORMS Journal on Computing 19 1 2007 27 35
5. P.C. Gilmore, and R.E. Gomory A linear programming approach to the cutting stock problem Operations Research 8 1961 849 859
6. A. Aloisio, C. Arbib, F. Marinelli, On LP relaxations for the pattern minimization problem, Networks (in press).
7. Alves Cludio, and J.M. Valrio de Carvalho A branch-and-price-and-cut algorithm for the pattern minimization problem RAIRO Operations Research 42 2008 435 453
8. H.H. Yanasse, and M.J.P. Lamosa An integrated cutting stock and sequencing problem European Journal of Operational Research 183 2007 1353 1370 (Pubitemid 47033912)
9. C. Arbib, F. Marinelli, P. Ventura, Cutting stock with bounded open stacks: a new integer linear programming model, Technical Report TRCS 007/2010, Universit degli Studi di L'Aquila, 2010.
10. C. Arbib, F. Marinelli, C.M. Scoppola, A lower bound for the cutting stock problem with a limited number of open sbtacks, in: Proc. of CTW09: 8th Cologne-Twente Workshop on Graph and Combinatorial Optimization, Paris, (France), June 25, 2009.
11. C. Arbib, F. Marinelli, F. Pezzella, Controlling open stacks and flow time in a cutting process, in: 6th ESICUP Meeting, Valencia, Spain, March, 2009 pp. 2557.
12. M. Pinedo Scheduling: Theory, Algorithms and Systems 1995 Prentice-Hall Englewood Cliffs New Jersey
13. F. Harary Graph Theory 1971 Addison Wesley Reading (MA)
14. C. McDiarmid Pattern minimisation in cutting stock problems Discrete Applied Mathematics 98 1999 121 130 (Pubitemid 129639770)
15. V. Chvatal, P.L. Hammer, Set-packing and threshold graphs, Res. Rept. CORR University of Waterloo, 1973 pp. 366422.
16. G.J. Woeginger, and Z. Yu On the equal-subset-sum problem Information Processing Letters 42 1992 299 302 (Pubitemid 23560479)
17. C. Arbib, and F. Marinelli The lazy cook problem, or scheduling two parallel machines to optimize vehicle utilization International Journal of Flexible Manufacturing Systems 15 4 2003 333 354
18. A. Schrijver Combinatorial Optimization: Polyhedra and Efficiency 2003 Springer-Verlag Berlin, Heidelberg, New York
19. A. Agnetis, P. Detti, C. Meloni, and D. Pacciarelli A linear algorithm for the Hamiltonian completion number of the line graph of a tree Information Processing Letters 79 2001 17 24 (Pubitemid 32404837)
20. G. Tinhofer Bin-packing and matching in threshold graphs Discrete Applied Mathematics 62 1995 279 289
21. T. Gau, and G. Wscher CUTGEN1: a problem generator for the standard one-dimensional cutting stock problem European Journal of Operational Research 84 1995 572 579