Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs

ABSTRACT This article studies a multi-agent scheduling problem on a set of m machines in a no-wait flow shop system, where each agent's objective function is to maximize its own weighted number of just-in-time jobs. Two variants of the problem are investigated. One is the constrained optimization problem and the other is the Pareto optimization problem. When the number of agents is arbitrary, both problems are proved to be strongly -hard. When the number of agents is fixed, pseudo-polynomial time algorithms are first designed to solve them, respectively, then an -approximation algorithm is provided for the former problem, and an -approximate Pareto-optimal frontier is constructed for the latter problem.

[1]  Yuanwei Jing,et al.  Optimal Research and Numerical Simulation for Scheduling No-Wait Flow Shop in Steel Production , 2013, J. Appl. Math..

[2]  Alessandro Agnetis,et al.  Multi-agent single machine scheduling , 2007, Ann. Oper. Res..

[3]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[4]  Jose M. Framiñan,et al.  A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems , 2014, Eur. J. Oper. Res..

[5]  Joseph Y.-T. Leung,et al.  Competitive Two-Agent Scheduling and Its Applications , 2010, Oper. Res..

[6]  T. C. Edwin Cheng,et al.  Fixed interval scheduling: Models, applications, computational complexity and algorithms , 2007, Eur. J. Oper. Res..

[7]  T. C. Edwin Cheng,et al.  A note on the complexity of the problem of two-agent scheduling on a single machine , 2006, J. Comb. Optim..

[8]  Joanna Józefowska,et al.  Just-in-Time Scheduling : Models and Algorithms for Computer and Manufacturing Systems , 2007 .

[9]  Jon M. Peha,et al.  Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time , 1995, Comput. Oper. Res..

[10]  Mihalis Yannakakis,et al.  On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11]  Yu-Hsiang Chung,et al.  A parallel-machine scheduling problem with two competing agents , 2017 .

[12]  Byung-Cheon Choi,et al.  Maximizing the weighted number of just-in-time jobs in flow shop scheduling , 2007 .

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

[14]  Claudio Arbib,et al.  A competitive scheduling problem and its relevance to UMTS channel assignment , 2004, Networks.

[15]  Ali Allahverdi,et al.  A survey of scheduling problems with no-wait in process , 2016, Eur. J. Oper. Res..

[16]  Hans Röck,et al.  Some new results in flow shop scheduling , 1984, Z. Oper. Research.

[17]  T. C. Edwin Cheng,et al.  Multi-agent scheduling on a single machine with max-form criteria , 2008, Eur. J. Oper. Res..

[18]  Lin Chen,et al.  Approximation schemes for two-machine flow shop scheduling with two agents , 2012, J. Comb. Optim..

[19]  Wen-Chiung Lee,et al.  A two-machine flowshop problem with two agents , 2011, Comput. Oper. Res..

[20]  Gur Mosheiov,et al.  Single machine scheduling to minimize the number of early and tardy jobs , 1996, Comput. Oper. Res..

[21]  Kunihiko Hiraishi,et al.  Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs , 2000, Comput. Oper. Res..

[22]  Shao Chin Sung,et al.  A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines , 2005, Comput. Oper. Res..

[23]  Chelliah Sriskandarajah,et al.  A review of TSP based approaches for flowshop scheduling , 2006, Eur. J. Oper. Res..

[24]  Dvir Shabtay,et al.  Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems , 2010, Journal of Scheduling.

[25]  Erhan Kozan,et al.  Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model , 2011, Transp. Sci..

[26]  Fardin Ahmadizar,et al.  Single-machine earliness–tardiness scheduling with two competing agents and idle time , 2017 .

[27]  Gur Mosheiov,et al.  A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop , 2015, Inf. Process. Lett..

[28]  Yunqiang Yin,et al.  Just-in-time scheduling with two competing agents on unrelated parallel machines ☆ , 2016 .

[29]  Omri Dover,et al.  Single-machine two-agent scheduling involving a just-in-time criterion , 2015 .

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[32]  Byung-Cheon Choi,et al.  Two-agent single-machine scheduling problem with just-in-time jobs , 2014, Theor. Comput. Sci..

[33]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

[34]  Dvir Shabtay,et al.  The just-in-time scheduling problem in a flow-shop scheduling system , 2012, Eur. J. Oper. Res..

[35]  Shao Chin Sung,et al.  Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines , 2005, J. Sched..

[36]  T. C. Edwin Cheng,et al.  Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs , 2006, Theor. Comput. Sci..

[37]  Byung-Cheon Choi,et al.  Approximation algorithms for multi-agent scheduling to minimize total weighted completion time , 2009, Inf. Process. Lett..

[38]  Gur Mosheiov,et al.  Scheduling problems with two competing agents to minimize minmax and minsum earliness measures , 2010, Eur. J. Oper. Res..

[39]  Wenzhu Liao,et al.  Multi-objective group scheduling optimization integrated with preventive maintenance , 2017 .

[40]  Shaohua Zhang,et al.  Predictive-reactive scheduling for single surgical suite subject to random emergency surgery , 2015, J. Comb. Optim..

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

[42]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .