A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion

This paper studies a two-agent single-machine scheduling problem with sum-of-processing-times-based learning consideration. The goal is to find an optimal schedule to minimize the total late work of the first agent subject to the restriction that the maximum lateness of the second agent has an upper bound. For this problem, a branch-and-bound algorithm along with several dominances and a lower bound is developed to find the optimal solution, and a tabu algorithm with several improvements is proposed to find the near-optimal solution. Computational experiments are provided to further measure the performance of the proposed algorithms.

[1]  Malgorzata Sterna,et al.  Open shop scheduling problems with late work criteria , 2004, Discret. Appl. Math..

[2]  Gur Mosheiov,et al.  Single machine batch scheduling with two competing agents to minimize total flowtime , 2011, Eur. J. Oper. Res..

[3]  T.C.E. Cheng,et al.  CON/SLK due date assignment and scheduling on a single machine with two agents , 2016 .

[4]  Wei Sun,et al.  Combining local search into non-dominated sorting for multi-objective line-cell conversion problem , 2013, Int. J. Comput. Integr. Manuf..

[5]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

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

[7]  Malgorzata Sterna,et al.  Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect , 2017, Comput. Ind. Eng..

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

[9]  B. M. T. Lin,et al.  Two-machine flow-shop scheduling to minimize total late work , 2006 .

[10]  Dehua Xu,et al.  Some scheduling problems with general position-dependent and time-dependent learning effects , 2009, Inf. Sci..

[11]  Wang Yong,et al.  Two-agent scheduling problems on a single-machine to minimize the total weighted late work , 2017, J. Comb. Optim..

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

[13]  Xiaoping Li,et al.  A Quantum-inspired Iterated Greedy algorithm for permutation flowshops in a collaborative manufacturing environment , 2012, Int. J. Comput. Integr. Manuf..

[14]  Chris N. Potts,et al.  Approximation algorithms for scheduling a single machine to minimize total late work , 1992, Oper. Res. Lett..

[15]  Ameur Soukhal,et al.  Two-agent scheduling with agent specific batches on an unbounded serial batching machine , 2014, Journal of Scheduling.

[16]  Ji-Bo Wang,et al.  A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect , 2015, Asia Pac. J. Oper. Res..

[17]  T. C. Edwin Cheng,et al.  Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions , 2014, Comput. Ind. Eng..

[18]  Christos Koulamas,et al.  Single-machine and two-machine flowshop scheduling with general learning functions , 2007, Eur. J. Oper. Res..

[19]  Chin-Chia Wu,et al.  A tabu method for a two-agent single-machine scheduling with deterioration jobs , 2013, Comput. Oper. Res..

[20]  Shuenn-Ren Cheng,et al.  A Single-Machine Two-Agent Scheduling Problem by GA Approach , 2012, Asia Pac. J. Oper. Res..

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

[22]  Yuzhong Zhang,et al.  The NP-Hardness of Minimizing the Total Late Work on an Unbounded Batch Machine , 2009, Asia Pac. J. Oper. Res..

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

[24]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

[25]  Dujuan Wang,et al.  A two-agent single-machine scheduling problem with late work criteria , 2017, Soft Comput..

[26]  T. C. Edwin Cheng,et al.  Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs , 2017, J. Sched..

[27]  T. C. Edwin Cheng,et al.  Multi-agent single-machine scheduling and unrestricted due date assignment with a fixed machine unavailability interval , 2017, Comput. Ind. Eng..

[28]  Claude-Nicolas Fiechter,et al.  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..

[29]  C. T. Ng,et al.  Two‐agent scheduling on a single sequential and compatible batching machine , 2017 .

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

[31]  Joseph Y.-T. Leung,et al.  Scheduling two agents with controllable processing times , 2010, Eur. J. Oper. Res..

[32]  Ghasem Moslehi,et al.  A two-agent scheduling problem in a two-machine flowshop , 2018 .

[33]  T. C. Edwin Cheng,et al.  A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations , 2011, Comput. Ind. Eng..

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

[35]  Malgorzata Sterna,et al.  A survey of scheduling problems with late work criteria , 2011 .

[36]  Gur Mosheiov,et al.  Scheduling problems with two competing agents to minimized weighted earliness-tardiness , 2013, Comput. Oper. Res..

[37]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[38]  Yang Kuei Lin,et al.  Uniform parallel machine scheduling problems with a truncation sum-of-logarithm-processing-times-based learning effect , 2015 .

[39]  Dirk Biskup,et al.  A state-of-the-art review on scheduling with learning effects , 2008, Eur. J. Oper. Res..

[40]  Yu-Bin Wu,et al.  Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times , 2015, Neural Computing and Applications.

[41]  Chin-Chia Wu,et al.  Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations , 2012, J. Intell. Manuf..

[42]  Sotiris Makris,et al.  An intelligent search algorithm-based method to derive assembly line design alternatives , 2012, Int. J. Comput. Integr. Manuf..

[43]  T. C. Edwin Cheng,et al.  Two-agent scheduling with position-based deteriorating jobs and learning effects , 2011, Appl. Math. Comput..