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

This work considers an NP-Hard scheduling problem that is fundamental to the production planning of flexible machines, to cutting pattern industries and also to the design of VLSI circuits. A new asynchronous collective search model is proposed, exploring the search space in a manner that concentrates effort onto those areas of higher perceived potential. This is done with the use of a coordination policy which enables the processes with greatest performance to act as ‘attractors’ to those processes trapped in areas of worse perceived potential. Numerical results are obtained for problems of realistic industrial size, and those results are compared to previously published optimal solutions. This comparison demonstrates the effectiveness of the method, as in 276 problems out of a set of 280 we are able to match previously reported optimal results.

[1]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[2]  Boon J. Yuen.  Heuristics for sequencing cutting patterns , 1991 .

[3]  Alberto Caprara,et al.  Sorting Permutations by Reversals and Eulerian Cycle Decompositions , 1999, SIAM J. Discret. Math..

[4]  Teodor Gabriel Crainic,et al.  Communication Issues in Designing Cooperative Multi-Thread Parallel Searches , 1996 .

[5]  Stefan Voß,et al.  Applications of modern heuristic search methods to pattern sequencing problems , 1999, Comput. Oper. Res..

[6]  Horacio Hideki Yanasse,et al.  Linear gate assignment: a fast statistical mechanics approach , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  M. Golumbic.  Chapter 3 - Perfect graphs , 2004 .

[8]  G Frizelle,et al.  Minimizing the number of tool switches on a flexible machine: An empirical study , 2001 .

[9]  Boon J. Yuen.  Improved heuristics for sequencing cutting patterns , 1995 .

[10]  Christopher S. Tang,et al.  Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants , 1988, Oper. Res..

[11]  J. Bard.  A Heuristic for Minimizing the Number of Tool Switches on a Flexible Machine , 1988 .

[12]  Kenneth V. Richardson,et al.  Establishing the optimality of sequencing heuristics for cutting stock problems , 1995 .

[13]  Teodor Gabriel Crainic,et al.  Self-organization in cooperative tabu search algorithms , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[14]  Christopher S. Tang,et al.  Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches , 1988, Oper. Res..

[15]  Horacio Hideki Yanasse.  On a pattern sequencing problem to minimize the maximum number of open stacks , 1997, Eur. J. Oper. Res..

[16]  Alexandre Linhares.  INDUSTRIAL PATTERN SEQUENCING PROBLEMS: SOME COMPLEXITY RESULTS AND NEW LOCAL SEARCH MODELS , 2004 .

[17]  C. A. Bentivoglio,et al.  Heuristic and exact methods for the cutting sequencing problem , 1998, Eur. J. Oper. Res..