Selection and scheduling in a virtual organisation environment with a service broker

This paper addresses the problems of selection and scheduling related to a virtual organisation in which a central service broker communicates with groups of service providers offering services of different types. Our objective is to show that these problems can be formulated in a precise manner and that well-established algorithms can be developed for solving them. Especially, Tabu Search and Simulated Annealing with Variable Neighbourhood search are proposed as options for finding near-optimal solutions to the selection and scheduling problems. In our computational experiments, the algorithms were first validated with the help of benchmark job-shop problems and then applied to a specific cutting stock problem with randomly generated instances.

[1]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[2]  Gareth Jones,et al.  Searching Databases of Two-Dimensional and Three-Dimensional Chemical Structures Using Genetic Algorithms , 1993, International Conference on Genetic Algorithms.

[3]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

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

[5]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[6]  Robert J. T. Morris,et al.  Heuristic methods for flexible flow line scheduling , 1987 .

[7]  Hyung Rim Choi,et al.  A Time-Bound Framework for Negotiation and Decision Making of Virtual Manufacturing Enterprise , 2004, J. Organ. Comput. Electron. Commer..

[8]  Víctor Parada,et al.  A client-broker-server architecture of a virtual enterprise for cutting stock applications , 2001, Int. J. Comput. Integr. Manuf..

[9]  Martina Gorges-Schleuter,et al.  Application of Genetic Algorithms to Task Planning and Learning , 1992, Parallel Problem Solving from Nature.

[10]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[11]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[12]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[13]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[14]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[15]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

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

[17]  Robert J. Wittrock,et al.  Scheduling Algorithms for Flexible Flow Lines , 1985, IBM J. Res. Dev..

[18]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[19]  Hannu Ahonen,et al.  A multi-mode resource-constrained scheduling problem in the context of port operations , 2006, Comput. Ind. Eng..

[20]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[21]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .