A client-broker-server architecture of a virtual enterprise for cutting stock applications

Cutting workpieces of given shapes and sizes from an object of larger dimensions with minimal material loss is a practical problem whose optimal or suboptimal solutions have great economic value in many applications. The solution to this problem often requires automated tools, which may not be achievable for small and medium sized enterprises. For this, an approach is proposed based on the concept of virtual enterprise using a client-broker-server architecture as an implementational model. Details of the architecture and its implementation are analysed.

[1]  Loris Faina,et al.  An application of simulated annealing to the cutting stock problem , 1999, Eur. J. Oper. Res..

[2]  Composite stock cutting through simulated annealing , 1992 .

[3]  Timothy W. Finin,et al.  KQML as an agent communication language , 1994, CIKM '94.

[4]  P. Y. Wang,et al.  Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..

[5]  Andrew B. Whinston,et al.  Using client-broker-server architecture for Intranet decision support , 1997, Decis. Support Syst..

[6]  Solly Andy Segenreich,et al.  Optimal nesting of general plane figures: A Monte Carlo heuristical approach , 1986, Comput. Graph..

[7]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[8]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[9]  Reinaldo Morabito,et al.  Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems , 1995 .

[10]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[11]  Nicos Christofides,et al.  An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts , 1995 .

[12]  Antonio Albano,et al.  Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  Mauricio Solar,et al.  Solution for the constrained guillotine cutting problem by simulated annealing , 1998, Comput. Oper. Res..

[14]  Joaquín Bautista,et al.  Procedures for solving a 1-dimensional cutting problem , 1994 .

[15]  J Błażewicz,et al.  An Improved Version of Tabu Search for Irregular Cutting Problems , 1993 .

[16]  Arlindo Gomes de Alvarenga,et al.  A Hybrid Genetic Algorithm for the Two - Dimensional Guillotine Cutting Problem , 1995 .

[17]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[18]  G. Doumeingts,et al.  Solving a cutting problem based on existing patterns , 1994 .

[19]  Thomas Lengauer,et al.  Computing closely matching upper and lower bounds on textile nesting problems , 1998, Eur. J. Oper. Res..

[20]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[21]  K. A. Dowsland,et al.  Jostling for position: local improvement for irregular cutting patterns , 1998, J. Oper. Res. Soc..

[22]  A. I. Hinxman.  The trim-loss and assortment problems: A survey , 1980 .

[23]  J. Błażewicz,et al.  A local search approach for two-dimensional irregular cutting , 1995 .

[24]  Reinaldo Morabito,et al.  Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach , 1996 .

[25]  Arlindo Gomes de Alvarenga,et al.  Exact solutions for constrained two-dimensional cutting problems , 1995 .

[26]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[27]  JoséFernando Oliveira,et al.  An improved version of Wang's algorithm for two-dimensional cutting problems , 1990 .

[28]  Command Processor,et al.  Pattern-Oriented Software Architecture: A System of Patterns, Buschman, Meunier, Rohnert, , 1996 .

[29]  M. Arenales,et al.  An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems , 1995 .

[30]  Miro Gradisar,et al.  A sequential heuristic procedure for one-dimensional cutting , 1999, Eur. J. Oper. Res..

[31]  V. Milenkovic,et al.  Compaction and separation algorithms for non-convex polygons and their applications☆ , 1995 .

[32]  Dan Harkey,et al.  Essential client/server survival guide , 1994 .

[33]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[34]  K. Dowsland,et al.  Solution approaches to irregular nesting problems , 1995 .

[35]  David L. Spooner,et al.  Sharing manufacturing information in virtual enterprises , 1996, CACM.