Applications of modern heuristic search methods to pattern sequencing problems

Computers and Operations Research

Volumn 26, Issue 1, 1999, Pages 17-34

  Fink, Andreas ^a   Voß, Stefan ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Heuristic search; Pattern sequencing; Production planning; Tabu search

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; OPTIMIZATION; PLANNING; PRODUCTION ENGINEERING;

HEURISTIC SEARCH; PATTERN SEQUENCING; PRODUCTION PLANNING; TABU SEARCH;

OPERATIONS RESEARCH;

METHODOLOGY; PLANNING METHOD;

EID: 0032782395     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)80001-4     Document Type: Article

References (19)

1. Yanasse HH. On a pattern sequencing problem to minimize the maximum number of open stacks. European Journal of Operational Research 1997;100:454-63.
2. Madsen OBG. An application of travelling-salesman routines to solve pattern-allocation problems in the glass industry. Journal of the Operational Research Society 1988;39:249-56.
3. Cheng TCE, Diamond J, Lin BMT. Optimal scheduling in film production to minimize talent hold cost. Journal of Optimization Theory and Applications 1993;79:197-206.
4. Nordström A-L, Tufekci S. A genetic algorithm for the talent scheduling problem. Computers and Operations Research 1994;21:927-40.
5. Alizadeh F, Karp RM, Newberg LA, Weisser DK. Physical mapping of chromosomes: A combinatorial problem in molecular biology. Algorithmica 1995;13:52-76.
6. Deutsch SB, Martin JJ. An ordering algorithm for analysis of data items. Operations Research 1971;19:1350-62.
7. McCormick WT, Jr., Schweitzer PJ, White TW. Problem decomposition and data reorganization by a clustering technique. Operations Research 1972;20:993-1009.
8. Morse PM. Optimal linear ordering of information items. Operations Research 1972;20:741-51.
9. Hoffer JA, Severance DG. The use of cluster analysis in physical database design. In: Proceedings of the 1st International Conference on Very Large Data Bases (VLDB). Silverspring, MD: IEEE Computer Society 1975:69-86.
10. Foerster H, Wäscher G. Simulated annealing for the order spread minimization problem in sequencing cutting patterns. European Journal of Operational Research 1998 (to appear).
11. Yuen BJ. Improved heuristics for sequencing cutting patterns. European Journal of Operational Research, 1995;87:57-64.
12. Garey MR, Johnson DS. Computers and Intractability, A Guide to the Theory of Script NP-completeness. New York: Freeman, 1979.
13. Yuen BJ. Heuristics for sequencing cutting patterns. European Journal of Operational Research 1991;55:183-90.
14. Yuen BJ, Richardson KV. Establishing the optimality of sequencing heuristics for cutting stock problems. European Journal of Operational Research 1995;84:590-8.
15. Foerster H. Fixkosten- und Reihenfolgeprobleme in der Zuschnittplanung. Ph.D. thesis, Technische Universität Braunschweig, 1998.
16. Dowsland KA. Simulated annealing. In: Reeves C, editor. Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell Scientific Publications 1993:20-69.
17. Glover F, Laguna M. Tabu Search. Boston: Kluwer, 1997.
18. Woodruff DL, Zemel E. Hashing vectors for tabu search. Annals of Operations Research 1993;41:123-38.
19. Battiti R. Reactive search: Toward self-tuning heuristics. In: Rayward-Smith VJ, Osman IH, Reeves CR, Smith GD, editors. Modern Heuristic Search Methods. Chichester: Wiley, 1996:61-83.