Solving a bi-criterion cutting stock problem with open-ended demand: A case study

Journal of the Operational Research Society

Volumn 51, Issue 11, 2000, Pages 1238-1247

  Kolen, A W J ^a   Spieksma, F C R ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Cutting stock problem; Multi objective; Practice of OR

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PARETO PRINCIPLE; STRATEGIC PLANNING;

BRANCH-AND-BOUND ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0034322881     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601023     Document Type: Article

References (11)

1. Kantorovich LV (I960). Mathematical methods of organizing and planning production. Man Sci 6: 366-422.
2. Gilmore P and Gomory RE (1961). A linear programming approach to the cutting-stock problem part I. Opns Res 9: 849-859.
3. Gilmore P and Gomory RE (1963). A linear programming approach to the cutting-stock problem part II. Opns Res 11: 863-888.
4. Degraeve Z and Peeters M (1998). Benchmark results for the cutting stock and bin packing problem. Report 9820, Catholic University Leuven, Belgium.
5. Dychoff H and Finke U (1992). Cutting and Packing in Production and Distribution. Physica-Verlag: Heidelberg.
6. Chvatal V (1980). Linear Programming. W.H. Freeman and Company: New York.
7. Haessler RW and Sweeney PE (1991). Cutting stock problems and solution procedures. Eur J Opl Res 54: 141-150.
8. Chengbin C and Antonio J (1999). Approximation algorithms to solve real-life multicriteria cutting stock problems. Opns Res 47: 495-508.
9. Diegel A et al (1996). Setup minimising conditions in the trim loss problem. Eur J Opl Res 95: 631-640.
10. Valerio de Carvalho JM and Guimaraes Rodrigues AJ (1995). An LP-based approach to a two-stage cutting stock problem. Eur J Opl Res 84: 580-589.
11. McCormick ST, Smallwood SR and Spieksma FCR (1997). A polynomial algorithm for multiprocessor scheduling with two job lengths. In: Proceedings of the 8th Symposium On Discrete Algorithms, ACM-SIAM, USA, pp 509-517.