Minimization of open orders: Application of a re-distribution coordination policy

International Journal of Production Research

Volumn 42, Issue 6, 2004, Pages 1189-1205

  Linhares, Alexandre ^a,b  

^a FUNDAÇÃO GETÚLIO VARGAS   (Brazil)

^b INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CUTTING; LOGIC DESIGN; MATRIX ALGEBRA; ONLINE SEARCHING; OPTIMAL SYSTEMS; SCHEDULING; STATISTICAL MECHANICS; VLSI CIRCUITS;

COLLECTIVE LOCAL SEARCH MODEL; FLEXIBLE MACHINES;

PRODUCTION ENGINEERING;

EID: 1242332763     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540310001622421     Document Type: Article

References (18)

1. BARD, J. F., 1988, A heuristic for minimizing the number of tool switches on a flexible machine. IIE Transactions, 20, 382-391.
2. CAPRARA, A., 1999, Sorting permutations by reversal and Eulerian cycle decompositions. SIAM Journal on Discrete Mathematics, 12, 91-110.
3. FAGIOLLI, E. and BENTIVOGLIO, C. A., 1998, Heuristic and exact methods for the cutting sequencing problem. European Journal of Operational Research, 110, 564-575.
4. FINK, A. and Voss, S., 1999, Applications of modern heuristic search techniques to pattern sequencing problems. Computers & Operations Research, 26, 17-34.
5. GOLUMBIC, M. C., 1980, Algorithmic Graph Theory and Perfect Graphs (London: Academic Press).
6. LINHARES, A., 2001, Industrial pattern sequencing problems: some complexity results and new local search models, PhD thesis, Brazilian Institute of Space Research, São José dos Campos.
7. LINHARES, A. and TORRÃO, J. R. A., 1998, Microcanonical optimisation applied to the travelling salesman problem. International Journal of Modern Physics, C9, 133-146.
8. LINHARES, A. and YANASSE, H. H., 2002a, Connections between cutting pattern sequencing, VLSI layouts, and flexible machines. Computers & Operations Research, 29(12), 1759-1772.
9. LINHARES, A. and YANASSE, H. H., 2002b, Local search intensity versus local search diversity: a false tradeoff? Manuscript submitted for publication.
10. LINHARES, A., YANASSE, H. H. and TORREÃO, J. R. A., 1999, Linear gate assignment: a fast statistical mechanics approach. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18(12), 1750-1758.
11. SHIRAZI, R. and FRIZELLE, G. D. M., 2001, Minimizing the number of tool switches on a flexible machine: an empirical study. International Journal of Production Research, 39, 3547-3560.
12. TANG, C. S. and DENARDO, E. V., 1988, Models arising from a flexible manufacturing machine, part I: minimization of the number of tool switches. Operations Research, 36, 767-777.
13. TOULOUSE, M., CRAINIC, T. G. and GENDREAU, M., 1996, Communication issues in designing cooperative multi-thread parallel searches. In Osman, I., and Kelly, J. P. Meta-heuristics: Theory and Practice (Norwell, Ma: Kluwer Academic Publishers), pp. 501-522.
14. TOULOUSE, M., CRAINIC, T. G., SANSÓ, B. and THULASIRAMAN, K., 1998, Self-organization in cooperative tabu search algorithms. Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics, San Diego, CA, pp. 2397-2385.
15. YANASSE, H. H., 1997, On a pattern sequencing problem to minimize the maximum number of open stacks. European Journal of Operational Research, 100, 454-463.
16. YUEN, B. J., 1991, Heuristics for sequencing cutting patterns. European Journal of Operational Research, 55, 183-190.
17. YUEN, B. J., 1995, Improved heuristics for sequencing cutting patterns. European journal of Operational Research, 87, 57-64.
18. YUEN, B. J. and RICHARDSON, K. V., 1995, Establishing the optimality of sequencing heuristics for cutting stock problems. European Journal of Operational Research, 84, 590-598.