An LP-based tabu search for batch scheduling in a cutting process with finite buffers

International Journal of Production Economics

Volumn 136, Issue 2, 2012, Pages 287-296

  Arbib, Claudio ^a   Marinelli, Fabrizio ^b   Pezzella, Ferdinando ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

Author keywords

Batch scheduling; Cutting stock; Heuristics; Open stacks

Indexed keywords

AUTOMATIC FEEDERS; BATCH SEQUENCING PROBLEMS; BATCH-SCHEDULING; COMPUTATION TIME; COMPUTATIONAL STUDIES; CRITICAL RESOURCES; CUTTING PROCESS; CUTTING STOCK; CUTTING STOCK PROBLEM; FINITE BUFFER; HEURISTICS; OPEN STACKS; OUTPUT SEQUENCES; RESOURCE CONSTRAINT; SOLUTION QUALITY; TEST PROBLEM; WORST CASE;

COMPUTATIONAL EFFICIENCY; CUTTING; INTEGER PROGRAMMING; PROBLEM SOLVING; SCHEDULING; TABU SEARCH;

SCHEDULING ALGORITHMS;

EID: 84857454524     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2011.12.003     Document Type: Article

References (28)

1. A. Aloisio, C. Arbib, and F. Marinelli Cutting stock with no three parts per pattern: work-in-process and pattern minimization Discrete Optimization 8 2010 315 332
2. C. Arbib, M. Flammini, and F. Marinelli Minimum flow time graph ordering Proceedings of the WG02: Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science vol. 2880 2003 Springer-Verlag 23 33
3. C. Arbib, and F. Marinelli Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application European Journal of Operational Research 163 3 2005 617 630
4. Arbib, C.; Marinelli, F.; Ventura, P.; 2010. Cutting Stock with Bounded Open Stacks: A New Integer Linear Programming Model. Technical Report, e-print on Optimization Online.
5. M. Armbruster A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry European Journal of Operational Research 141 2 2002 240 328
6. G. Belov, and G. Scheithauer Setup and open-stacks minimization in one-dimensional stock cutting INFORMS Journal on Computing 19 1 2007 27 35
7. BIESSE Group, 2011. 〈 http://www.biesse.com/en/corporate/products/ 〉 technology.
8. C.H. Cheng, B.R. Feiring, and T.C.E. Cheng The cutting stock problem - a survey International Journal of Production Economics 36 3 1994 291 305
9. G. Chu, and P. Stuckey Minimizing the maximum number of open stacks by customer search Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science 2009 Springer-Verlag 242 257
10. H. Dyckhoff, G. Scheithauer, and J. Terno Cutting and packing Annotated Bibliographies in Combinatorial Optimization 1997 Wiley 393 412
11. H. Foerster, and G. Wäscher Simulated annealing for order spread minimization in sequencing cutting patterns European Journal of Operational Research 110 2 1998 272 281 (Pubitemid 128387405)
12. T. Gau, and G. Wäscher Cutgen1: a problem generator for the standard one-dimensional cutting stock problem European Journal of Operational Research 84 1995 572 579
13. N. Gibbs, W.G. Poole Jr.; and P. Stockmeyer An algorithm for reducing the bandwidth and profile of a sparse matrix SIAM Journal on Numerical Analysis 13 2 1976 236 250
14. F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Publishers Boston
15. M.C.N. Gramani, P.M. França, and M.N. Arenales A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem International Journal of Production Economics 119 2 2009 219 227
16. O. Holthaus On the best number of different standard lengths to stock for one-dimensional assortment problems International Journal of Production Economics 83 3 2003 233 246
17. E. Horowitz, and S. Sahni Computing partitions with applications to the knapsack problem Journal of the ACM 21 1974 277 292
18. O.B.G. Madsen Glass cutting in a small firm Mathematical Programming 17 1979 85 90
19. K. Matsumoto, S. Umetani, and H. Nagamochi On the one-dimensional stock cutting problem in the paper tube industry Journal of Scheduling 14 2011 281 290
20. C.T. Ragsdale, and C.W. Zobel The ordered cutting stock problem Decision Sciences 35 1 2004 83 100 (Pubitemid 40816713)
21. H. Reinertsen, and T. Vossen The one-dimensional cutting stock problem with due dates European Journal of Operational Research 201 2010 701 711
22. SCOOP: Sheet Cutting and prOcess OPtimization for furniture enterprises (October 2006October 2008). European Sixth Framework Programme, Specific Research Projects for SMEs, 〈 http://www.scoop-project.net/ 〉.
23. Smith, B.; Gent, I.; July 2005. Constraint modelling challenge 2005. In: Fifth Workshop on Modelling and Solving Problems with Constraints.
24. F. Vanderbeck Computational study of a column generation algorithm for bin packing and cutting stock problems Mathematical Programming 86 3 1999 565 594
25. G. Wäscher, H. Haußner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 183 3 2007 1109 1130 (Pubitemid 47030730)
26. H. Yanasse On a pattern sequencing problem to minimize the maximum number of open stacks European Journal of Operational Research 100 1997 454 463 (Pubitemid 127392369)
27. H. Yanasse, and M. Lamosa An integrated cutting stock and sequencing problem European Journal of Operational Research 183 3 2007 1353 1370 (Pubitemid 47033912)
28. H.H. Yanasse, J.C. Becceneri, and N.Y. Soma Bounds for a problem of sequencing patterns Pesquisa Operacional 19 1999 249 278