The one-dimensional cutting stock problem with due dates

European Journal of Operational Research

Volumn 201, Issue 3, 2010, Pages 701-711

  Reinertsen, Harald ^a   Vossen, Thomas W M ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Cutting; Integer programming; Scheduling

Indexed keywords

CUTTING OPERATIONS; CUTTING STOCK; CUTTING STOCK PROBLEM; DUE DATES; ONE-DIMENSIONAL CUTTING STOCK PROBLEM; OPERATIONAL PERFORMANCE; OPTIMIZATION MODELS; REINFORCEMENT STEELS; ROLLING HORIZON; SOLUTION PROCEDURE;

DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; OPERATIONS RESEARCH; REINFORCEMENT; SCHEDULING;

CUTTING;

EID: 70349469606     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.03.042     Document Type: Article

References (27)

1. Alves C., and Valério de Carvalho J. One-dimensional cutting stock optimization in consecutive time periods. European Journal of Operational Research 179 2 (2007) 291-301
2. Alves C., and Valério de Carvalho J.M. New integer programming formulations and an exact algorithm for the ordered cutting stock problem. Journal of the Operational Research Society 59 (2007) 1520-1531
3. Alves C., and Valério de Carvalho J.M. A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Computers and Operations Research 35 4 (2008) 1315-1328
4. Belov G., and Scheithauer G. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. European Journal of Operational Research 171 1 (2006) 85-106
5. Bookbinder J., and Higginson J. Customer service vs trim waste in corrugated box manufacture. The Journal of the Operational Research Society 37 11 (1986) 1061-1071
6. Degraeve Z., and Peeters M. Optimal integer solutions to industrial cutting-stock problems: Part 2. Benchmark results. INFORMS Journal on Computing 15 1 (2003) 58-81
7. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research 44 2 (1990) 145-159
8. Dyson R., and Gregory A. The cutting stock problem in the flat glass industry. Operational Research Quarterly 25 1 (1974) 41-53
9. Eppstein D. Finding the k shortest paths. SIAM Journal on Computing 28 2 (1998) 652-673
10. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting-stock problem. Operations Research 9 6 (1961) 849-859
11. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting stock problem - Part II. Operations Research 11 6 (1963) 863-888
12. Johnston R.E., and Sadinlija E. A new model for complete solutions to one-dimensional cutting stock problems. European Journal of Operational Research 153 1 (2004) 176-183
13. Li S. Multi-job cutting stock problem with due dates and release dates. The Journal of the Operational Research Society 47 4 (1996) 490-510
14. Liang K., Yao X., Newton C., and Hoffman D. A new evolutionary approach to cutting stock problems with and without contiguity. Computers and Operations Research 29 12 (2002) 1641-1659
15. Menon S., and Schrage L. Order allocation for stock cutting in the paper industry. Operations Research 50 2 (2002) 324-332
16. Pierce J. Pattern sequencing and matching in cutting operations. TAPPI 53 4 (1970) 669-678
17. Poldi K.C., and Arenales M.N. Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. Computers and Operations Research 36 6 (2009) 2074-2081
18. Ragsdale C.T., and Zobel C.W. The ordered cutting stock problem. Decision Sciences 35 1 (2004) 83-100
19. Scheithauer G., and Terno J. Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem. Operations Research Letters 20 (1997) 93-100
20. Sweeney E., and Paternoster E.R. Cutting and packing problems: A categorized, application-oriented research bibliography. Journal of the Operational Research Society 43 (1992) 691-706
21. Trkman P., and Gradisar M. One-dimensional cutting stock optimization in consecutive time periods. European Journal of Operational Research 179 2 (2007) 291-301
22. Valério de Carvalho J.M. Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research 86 (1999) 629-659
23. Valério de Carvalho J.M. LP models for bin packing and cutting stock problems. European Journal of Operational Research 141 2 (2002) 253-273
24. Vance P., Barnhart C., Johnson E., and Nemhauser G. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications 3 2 (1994) 111-130
25. Wagner B. A genetic algorithm solution for one-dimensional bundled stock cutting. European Journal of Operational Research 117 2 (1999) 368-381
26. Wäscher G., Haussner H., and Schumann H. An improved typology of cutting and packing problems. European Journal of Operational Research 183 3 (2007) 1109-1130
27. Yanasse H.H., and Pinto Lamosa M.J. An integrated cutting stock and sequencing problem. European Journal of Operational Research 183 3 (2007) 1353-1370