Solving the n-job 3-stage flexible flowshop scheduling problem using an agent-based approach

In this paper, a general methodology of agent-based manufacturing systems scheduling, incorporating game theoretic analysis of agent cooperation is presented to solve the n-job 3-stage flexible flowshop scheduling problem. The flowshops are flexible in the sense that a job can be processed by any of the identical machines at each stage. Our objective is to schedule a set of n jobs so as to minimize the makespan. We perform error bound analysis using the lower bound estimates developed in the literature as a datum for comparing the agent-based scheduling solutions with other heuristic solutions. The results of the evaluation show that the agent-based scheduling approach outperforms existing heuristics for the majority of the testing problems.

[1]  Luis M. Camarinha-Matos,et al.  Negotiation in a multi-agent-based dynamic scheduling , 1994 .

[2]  Nicholas R. Jennings,et al.  Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.

[3]  Albert D. Baker,et al.  Manufacturing control with a market-driven contract net , 1992 .

[4]  J.Y.H. Fuh,et al.  Concurrent process planning and scheduling in distributed virtual manufacturing , 2002 .

[5]  Sarit Kraus,et al.  Feasible Formation of Coalitions Among Autonomous Agents in Nonsuperadditive Environments , 1999, Comput. Intell..

[6]  Neil A. Duffie,et al.  Nonhierarchical control of manufacturing systems , 1986 .

[7]  Jacques Carlier,et al.  Scheduling jobs with release dates and tails on identical machines to minimize the makespan , 1987 .

[8]  Victor R. Lesser,et al.  Coalitions Among Computationally Bounded Agents , 1997, Artif. Intell..

[9]  H. Van Dyke Parunak,et al.  The AARIA agent architecture: From manufacturing requirements to agent-based system design , 2001, Integr. Comput. Aided Eng..

[10]  S. H. Wu,et al.  Concurrent process planning and scheduling in distributed virtual manufacturing , 2002 .

[11]  E. Kohlberg.  On the Nucleolus of a Characteristic Function Game , 1971 .

[12]  James J. Solberg,et al.  INTEGRATED SHOP FLOOR CONTROL USING AUTONOMOUS AGENTS , 1992 .

[13]  Stefan Bussmann,et al.  An agent-based approach to the control of flexible production systems , 2001, ETFA 2001. 8th International Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.01TH8597).

[14]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[15]  Hugo Velthuijsen,et al.  Application of Distributed AI and Cooperative Problem Solving to Telecommunications , 1994 .

[16]  D. Norrie,et al.  An Agent-Based Approach for Dynamic Manufacturing Scheduling , 1998 .

[17]  W. Townsend.  Note---Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution , 1977 .

[18]  Katia Sycara,et al.  Multiagent coordination in tightly coupled task scheduling , 1997 .

[19]  Onn Shehory,et al.  Coalition structure generation with worst case guarantees , 2022 .

[20]  Salah E. Elmaghraby,et al.  Sequencing Three-Stage Flexible Flowshops with Identical Machines to Minimize Makespan , 2001 .

[21]  Erhan Kutanoglu,et al.  An Incentive Compatible Mechanism for Distributed Resource Planning , 2001 .

[22]  G. Reeke.  The society of mind , 1991 .

[23]  Chris N. Potts,et al.  A New Heuristic for Three-Machine Flow Shop Scheduling , 1996, Oper. Res..

[24]  Norman M. Sadeh,et al.  Resource allocation in distributed factory scheduling , 1991, IEEE Expert.

[25]  Michael R. Genesereth,et al.  Software agents , 1994, CACM.

[26]  Olivier Boissier,et al.  When Can Knowledge-Based Systems Be Called Agents? , 1992 .

[27]  Randall Davis,et al.  Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artif. Intell..

[28]  H. Van Dyke Parunak,et al.  The AARIA agent architecture: an example of requirements-driven agent-based system design , 1997, AGENTS '97.

[29]  Jörg P. Müller,et al.  A Model for Cooperative Transportation Scheduling , 1995, ICMAS.

[30]  Sunderesh S. Heragu,et al.  Intelligent agent modeling of an industrial warehousing problem , 2002 .

[31]  Hamideh Afsarmanesh,et al.  Multi-agent-based agile scheduling , 1999, Robotics Auton. Syst..

[32]  Norman M. Sadeh,et al.  Distributed constrained heuristic search , 1991, IEEE Trans. Syst. Man Cybern..

[33]  Jeffrey S. Rosenschein,et al.  Deals Among Rational Agents , 1985, IJCAI.

[34]  M. Solomon,et al.  Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time , 1996 .

[35]  Krithi Ramamritham,et al.  Dynamic Task Scheduling in Hard Real-Time Distributed systems , 1984, IEEE Software.

[36]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[37]  Keith S. Decker,et al.  Distributed problem-solving techniques: A survey , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[38]  Nicholas R. Jennings,et al.  Integrating Intelligent Systems into a Cooperating Community for Electricity Distribution Management , 1994 .

[39]  L. Shapley.  A Value for n-person Games , 1988 .

[40]  Nicholas R. Jennings,et al.  Transforming standalone expert systems into a community of cooperating agents , 1993 .

[41]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[42]  Randall Davis,et al.  Frameworks for Cooperation in Distributed Problem Solving , 1988, IEEE Transactions on Systems, Man, and Cybernetics.

[43]  Bruce C. Hartman,et al.  Agent-based project scheduling , 2000 .

[44]  George L. Vairaktarakis,et al.  Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..

[45]  Ursula M. Schwuttke,et al.  Enhancing Performance of Cooperating Agents in Real-Time Diagnostic Systems , 1993, IJCAI.

[46]  J. Galliers.  A theoretical framework for computer models of cooperative dialogue, acknowledging multiagent conflict , 1988 .

[47]  H. Van Dyke Parunak,et al.  Applications of distributed artificial intelligence in industry , 1996 .

[48]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[49]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[50]  Matthias Klusch,et al.  Dynamic Coalition Formation among Rational Agents , 2002, IEEE Intell. Syst..

[51]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.