A GENETIC ALGORITHM WITH MODIFIED CROSSOVER OPERATOR FOR A TWO-AGENT SCHEDULING PROBLEM

The problem of scheduling with multi agent has been studiedfor more than one decade and significant advances have been madeover the years. However, most work has paid more attention to the conditionthat machines are available during planning horizon. Motivatedby the observations, this paper studies a two-agent scheduling modelwith multiple availability constraint. Each agent aims at minimizing afunction which depends only on the completion times of its jobs. Theproblem is to find a schedule that minimizes the objective function ofone agent, subject to the objective function of the other agent does notexceed a given threshold Q. some new dominance properties for thisproblem percent and next, using these properties, we develop a geneticalgorithm with modified crossover for the problem. Computational resultsare also presented to determine the performance of the proposedgenetic algorithms.

[1]  Hervé Moulin,et al.  Scheduling with Opting Out: Improving upon Random Priority , 2001, Oper. Res..

[2]  Yulin Zhang,et al.  Single machine scheduling problem with two synergetic agents and piece-rate maintenance , 2013 .

[3]  Wen-Hsiang Wu,et al.  A Two-Agent Single-Machine Scheduling Problem with Learning and Deteriorating Considerations , 2013 .

[4]  Peng Liu,et al.  Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times , 2013 .

[5]  Yu-Hsiang Chung,et al.  A single-machine bi-criterion scheduling problem with two agents , 2013, Appl. Math. Comput..

[6]  Jing Fan,et al.  Maximum latency scheduling problem on two-person cooperative games , 2011, Journal of Combinatorial Optimization.

[7]  Yunqiang Yin,et al.  A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents , 2013, Appl. Soft Comput..

[8]  T. C. Edwin Cheng,et al.  Bounded parallel-batching scheduling with two competing agents , 2012, Journal of Scheduling.

[9]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[10]  Herbert Hamers,et al.  On games corresponding to sequencing situations with ready times , 1995, Math. Program..

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

[12]  Victor R. Lesser,et al.  Compensatory negotiation for agent-based project schedule coordination , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[13]  Chengbin Chu,et al.  A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..

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

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

[16]  Wen-Hung Wu,et al.  Solving a two-agent single-machine learning scheduling problem , 2014, Int. J. Comput. Integr. Manuf..

[17]  Chwen-Tzeng Su,et al.  A single-machine scheduling problem with maintenance activities to minimize makespan , 2010, Appl. Math. Comput..

[18]  Daniel C. Schultz,et al.  A QoS Concept for Packet Oriented S-UMTS Services , 2002 .

[19]  T.C.E. Cheng,et al.  Two-agent single-machine scheduling with release times and deadlines , 2013 .

[20]  Chwen-Tzeng Su,et al.  A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance , 2010, Expert Syst. Appl..