A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

We study an agent-based scheduling problem of two identical parallel machines: P 2 | Co | ∑ T A , C max B . The machines and tasks are regarded as agents. A new multi-agent scheduling model is proposed to achieve the optimum from the two task agents, agent A and agent B. The objective is divided into two classes. The objectives of agent A and agent B are to minimize the total tardiness time and minimize the makespan, respectively. In this article, we research two identical parallel machines in which one job category can be processed by one machine agent only or two machine agents and propose a new multi-agent model for two identical parallel machines, divided into two subsystems. For subsystem 1, the shortest processing time order is used to solve job priorities. A single distribution strategy is proposed to assign jobs to machine agents and is applied to the dynamic scheduling environment. For subsystem 2, a centralized distribution strategy is applied to the static scheduling environment. The proposed model performs more efficiently and is better able to handle complex and dynamic scheduling environments.

[1]  Bing Zhao,et al.  Two game-based solution concepts for a two-agent scheduling problem , 2016, Cluster Computing.

[2]  Xiwen Lu,et al.  A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines , 2015, Journal of Scheduling.

[3]  Ching-Jen Huang,et al.  Parallel machines scheduling with machine preference via agent-based approach , 2014, Appl. Math. Comput..

[4]  Alessandro Agnetis,et al.  Scheduling two agent task chains with a central selection mechanism , 2015, J. Sched..

[5]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

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

[7]  Nathan Fisher,et al.  Truthful Mechanisms for Competitive Reward-Based Scheduling , 2016, IEEE Transactions on Computers.

[8]  Richard Y. K. Fung,et al.  Coordination mechanism in real-time scheduling of Virtual Cellular Manufacturing Systems , 2016 .

[9]  Jinghua Li,et al.  Development of a Collaborative Scheduling System of Offshore Platform Project Based on Multiagent Technology , 2014 .

[10]  Ulrich Pferschy.  Scheduling the Tasks of Two Agents with a Central Selection Mechanism Gaia Nicosia , 2014 .

[11]  Jonathan Cole Smith,et al.  A Multiple-Criterion Model for Machine Scheduling , 2003, J. Sched..

[12]  Johanne Cohen,et al.  Coordination mechanisms for decentralized parallel systems , 2015, Concurr. Comput. Pract. Exp..

[13]  Xiwen Lu,et al.  Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan , 2016, J. Comb. Optim..

[14]  Donatas Elvikis,et al.  Two-agent scheduling on uniform parallel machines with min-max criteria , 2012, Annals of Operations Research.

[15]  Alessandro Agnetis,et al.  Scheduling Problems with Two Competing Agents , 2004, Oper. Res..

[16]  Lin Zhang,et al.  Development of a Collaborative 3D Virtual Monitoring System through Integration of Cloud Computing and Multiagent Technology , 2015 .

[17]  Wen-Chiung Lee,et al.  A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents , 2016, Knowl. Based Syst..

[18]  José R. Correa,et al.  Decentralized utilitarian mechanisms for scheduling games , 2015, Games Econ. Behav..

[19]  Guochuan Zhang,et al.  Coordination Mechanisms for Selfish Parallel Jobs Scheduling - (Extended Abstract) , 2012, TAMC.

[20]  Andrea Pacifici,et al.  Strategies in competing subset selection , 2013, Ann. Oper. Res..

[21]  Alessandro Agnetis,et al.  Two Agents Competing for a Shared Machine , 2013, ADT.

[22]  Shimon Y. Nof,et al.  Decentralized control of cooperative and autonomous agents for solving the distributed resource allocation problem , 2005 .