The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming

European Journal of Operational Research

Volumn 114, Issue 2, 1999, Pages 395-402

  Antonio, Julien ^a   Chauvet, Fabrice ^a   Chu, Chengbin ^b   Proth, Jean Marie ^a,c  

^a INRIA   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

Dynamic programming; Industrial application; Multicriteria cutting stock problem

Indexed keywords

COMPUTATIONAL METHODS; COSTS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; MARKETING; PROBLEM SOLVING; PROCESS ENGINEERING; PURCHASING;

MULTICRITERIA CUTTING STOCK PROBLEMS;

INVENTORY CONTROL;

EID: 0033115176     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00163-5     Document Type: Article

References (9)

1. E.G. Coffman Jr., M.R. Garey, D.S. Johnson, Approximation Algorithms for Bin-Packing - An Updated Survey, Bell Laboratories, Murray Hill, NJ, 1984.
2. M.R. Garey, D.S. Johnson, Approximation algorithms for bin packing problems: A survey, in: G. Ausiello, M. Lucertini (Eds.), Analysis and Design of Algorithms in Combinatorial Optimisation, Springer, Berlin, 1981, pp. 149-172.
3. Johnson D.S. Fast algorithms for bin packing. Journal of Computer and System Sciences. 8:1974;272-314.
4. J. Antonio, C. Chu, N. Sauer, P. Wolff, POEM project and solution for one-dimensional multi-criteria cutting stock problems, in: Operations Research Proceedings (SOR'95), Passeau, GE, 1995.
5. Dowsland K.A., Dowsland W.B. Packing problems. European Journal of Operational Research. 56(1):1992;2-14.
6. Dyckhoff H. A new linear programming approach to the cutting stock problem. Operations Research. 29:1981;1092-1104.
7. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research. 44(2):1990;145-159.
8. H. Dyckhoff, U. Finke, Cutting and Packing in Production and Distribution: A Typology and Bibliography, Physica, Aachen, GE, 1992.
9. P.C. Gilmore, R.E. Gomory, Linear programming approach to the cutting-stock problem, Operations Research 9 (1961).