A study of the single-machine two-agent scheduling problem with release times

In many management situations, multiple agents compete on the usage of common processing resources. On the other hand, the importance of the ready times can be shown in Wafer fabrication with the presence of unequal ready times. It is sometimes advantageous to form a non-full batch, while in other situations it is a better strategy to wait for future job arrivals in order to increase the fullness of the batch. However, research on scheduling with two-agent and ready time simultaneously is relatively unexplored. This paper addresses a single-machine two-agent scheduling problem with ready times. The aim is to find an optimal schedule to minimize the total completion time of the jobs of the first agent with the restriction that total completion time is allowed an upper bound for the second agent. To the best of our knowledge, the problem under study has not been considered. Firstly, we show that the proposed problem is strongly NP-hard. Following that, we then develop a branch-and-bound, an ant colony, and four genetic algorithms for an optimal and near-optimal solution, respectively. In addition, the extensive computational experiments are also given.

[1]  Colin R. Reeves,et al.  Heuristics for scheduling a single machine subject to unequal job release times , 1995 .

[2]  Vivek Patel,et al.  An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems , 2012 .

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

[4]  Yazid Mati,et al.  A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem , 2008, Comput. Oper. Res..

[5]  Chien-Min Lin,et al.  A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem , 2008, Expert Syst. Appl..

[6]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[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]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[9]  David Beasley,et al.  An overview of genetic algorithms: Part 1 , 1993 .

[10]  M. Dessouky.  Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness , 1998 .

[11]  Adam Janiak,et al.  Scheduling jobs with position-dependent processing times , 2004, J. Oper. Res. Soc..

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

[13]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[14]  Said Salhi,et al.  An Efficient Hybrid Genetic Algorithm for the MultiProduct Multi Period Inventory Routing Problem , 2011 .

[15]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

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

[17]  R. Rao,et al.  Multi-objective optimization of heat exchangers using a modified teaching-learning-based optimization algorithm , 2013 .

[18]  R. Venkata Rao,et al.  Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems , 2011, Comput. Aided Des..

[19]  Srikanth K. Iyer,et al.  Improved genetic algorithm for the permutation flowshop scheduling problem , 2004, Comput. Oper. Res..

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

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

[22]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[23]  Lixin Tang,et al.  Two-agent single-machine scheduling with position-dependent processing times , 2010 .

[24]  Tarek Y. ElMekkawy,et al.  Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm , 2011 .

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

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

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

[28]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[29]  T. C. Edwin Cheng,et al.  Two-agent scheduling to minimize the total cost , 2011, Eur. J. Oper. Res..

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

[31]  Lixin Tang,et al.  Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine , 2008, COCOON.

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

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

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

[35]  Weiping Shang,et al.  A note on the scheduling with two families of jobs , 2005, J. Sched..