Heuristic and exact methods for the cutting sequencing problem

European Journal of Operational Research

Volumn 110, Issue 3, 1998, Pages 564-575

  Faggioli, Enrico ^a,b   Bentivoglio, Carlo Alberto ^a  

^a UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

^b NONE   (Italy)

Author keywords

Cutting stock; Heuristics; Tabu search

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

CUTTING SEQUENCING PROBLEM; TABU SEARCH;

PRODUCTION CONTROL;

EID: 0032209948     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00268-3     Document Type: Article

References (15)

1. Andreatta, G., Basso, A., Caumo, A., Deserti, L., 1989. Un problema min cutwidth generalizzato e sue applicazioni ad un FMS. Atti delle giornate di lavoro AIRO, pp. 1-17 (in Italian).
2. Cheng, C.H., Feiring, B.R., Cheng, T.C.E., 1994. The cutting stock problem - A survey. International Journal of Production Economics 36 (3), 291-305.
3. Dyson, R.G., Gregory, A.S., 1974. The cutting stock problem in the flat glass industry. Operational Research Quarterly 25, 41-54.
4. Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of the NP-Completeness. Freeman, San Francisco, CA.
5. Gavril, F., 1977. Some NP-Complete Problems on Graphs. Proceedings of the Eleventh Conference on Information Sciences and Systems, Johns Hopkins University, Baltimore, pp. 91-95.
6. Glover, F., 1989. Tabu search, Part I. ORSA Journal on Computing 1, 190-206.
7. Glover, F., Laguna M., 1993. Tabu search. In: C. Reevs (Ed.), Modern Heuristics Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford, pp. 70-141.
8. Glover, F., Taillard, E., de Werra, D., 1993. A user's guide to tabu search. Annals of Operations Research 41, 3-28.
9. Laguna, M., 1993. A guide to implementing tabu search. Working Paper, Graduate School of Business and Administration, University of Colorado.
10. Madsen, O.B.G., 1979. Glass cutting in a small firm. Mathematical Programming 17, 85-90.
11. Madsen, O.B.G., 1980. A cutting sequencing algorithm. In: Iracki, K., Malanowski, M., Walukiewitz, S. (Eds.), Optimization Methods, Springer, Hamburg, 388-396.
12. Madsen, O.B.G., 1988. An application of travelling salesman routines to solve pattern allocation problems in the glass industry. Journal of the Operational Research Society 39, 249-256.
13. Yuen, B.J., 1991. Heuristics for sequencing cutting patterns. European Journal of Operational Research 55 (2), 183-190.
14. Yuen, B.J., Richardson, K.V., 1995. Establishing the optimality of sequencing heuristics for cutting stock problems. European Journal of Operational Research 84, 590-598.
15. Yuen, B.J., 1995. Improved heuristics for sequencing cutting patterns. European Journal of Operational Research 87, 57-64.