An Ordered Flow Shop with Two Agents

In this paper, we consider a two-agent scheduling problem in an m-machine ordered flow shop where each agent is responsible for his own set of jobs and wishes to minimize the makespan. Since the problem is NP-hard, we develop a pseudo-polynomial time approach for the case with a fixed number of machines and investigate the conditions that make the problem polynomially solvable. Finally, we consider a three-machine problem with a special processing time structure, and demonstrate its polynomiality.

[1]  T. C. Edwin Cheng,et al.  Two-agent single-machine scheduling to minimize the batch delivery cost , 2016, Comput. Ind. Eng..

[2]  T. C. Edwin Cheng,et al.  Two-agent single-machine scheduling with assignable due dates , 2012, Appl. Math. Comput..

[3]  Chris N. Potts,et al.  Rescheduling for New Orders , 2004, Oper. Res..

[4]  T. C. Edwin Cheng,et al.  Two-agent single-machine scheduling with unrestricted due date assignment , 2015, Comput. Ind. Eng..

[5]  R. A. Dudek,et al.  Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .

[6]  Chin-Chia Wu,et al.  Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties , 2012, Inf. Sci..

[7]  S. S. Panwalkar,et al.  Sequencing Research and the Industrial Scheduling Problem , 1973 .

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

[9]  T. C. Edwin Cheng,et al.  Two-agent single-machine scheduling with deteriorating jobs , 2015, Comput. Ind. Eng..

[10]  Wen-Chiung Lee,et al.  Two-agent scheduling with learning consideration , 2011, Comput. Ind. Eng..

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

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

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

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

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

[16]  Wen-Chiung Lee,et al.  Single-machine scheduling with two competing agents and learning consideration , 2013, Inf. Sci..

[17]  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..

[18]  S. S. Panwalkar,et al.  Flowshop sequencing problem with ordered processing time matrices: A general case , 1976 .

[19]  Jean-Charles Billaut,et al.  Single-machine multi-agent scheduling problems with a global objective function , 2011, Journal of Scheduling.

[20]  Gur Mosheiov,et al.  Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents , 2014, J. Oper. Res. Soc..

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

[22]  P. Liu,et al.  Two-agent single-machine scheduling problems under increasing linear deterioration , 2011 .

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

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

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