Advanced search
Publication Cover
International Journal of Production Research Volume 42, 2004 - Issue 6
Submit an article Journal homepage
15
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

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

Alexandre LinharesNational Institute of Space Research, LACjlNPE, Av Astronautas 1758, SJ.Campos, SP12227-OIO, Brazil.Correspondence[email protected]
Pages 1189-1205 | Received 01 Jul 2003, Published online: 21 Oct 2013

References

  • BARD, J. F., 1988, A heuristic for minimizing the number of tool switches on a flexible machine. IIE Transactions, 20, 382–391.
  • CAPRARA, A., 1999, Sorting permutations by reversal and Eulerian cycle decompositions. SIAM Journal on Discrete Mathematics, 12, 91–110.
  • FAGIOLLl, E. and BENTIVOGLIO, C. A., 1998, Heuristic and exact methods for the cutting sequencing problem. European Journal of Operational Research, 110, 564–575.
  • FINK, A. and Voss, S., 1999, Applications of modern heuristic search techniques to pattern sequencing problems. Computers & Operations Research. 26, 17–34.
  • GOLUMBIC, M. C., 1980, Algorithmic Graph Theory and Perfect Graphs (London: Academic Press).
  • 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.
  • 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.
  • LINHARES, A. and YANASSE, H. H., 2002a, Connections between cutting pattern sequencing, VLSI layouts, and flexible machines. Computers & Operations Research, 29(12), 1759–1772.
  • LINHARES, A. and YANASSE, H. H., 2002b, Local search intensity versus local search diversity: a false tradeoff? Manuscript submitted for publication.
  • LINHARES, A., YANASSE, H. H. and TORREAÃ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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • YUEN, B. J., 1991, Heuristics for sequencing cutting patterns. European Journal of Operational Research, 55, 183–190.
  • YUEN, B. J., 1995, Improved heuristics for sequencing cutting patterns. European journal of Operational Research, 87, 57–64.
  • 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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.