A modified imperialist competitive algorithm for a two-agent single-machine scheduling under periodic maintenance consideration

Scheduling with periodic maintenance has been widely studied. However, multi-agent scheduling with simultaneous considerations of periodic maintenance has hardly been considered until now. In view of this, this research focuses on the problem of scheduling jobs that come from two agents on a single machine under periodic maintenance constraint with the objective of minimising the total completion time of the jobs of the first agent while keeping the maximum tardiness of other agent below or at a fixed level UB. We present some new dominance properties for this strongly NP-hard problem. And next, using these properties, we develop a novel imperialist competitive algorithm for the problem. Various parameters of the proposed algorithm are reviewed by means of Taguchi experimental design. For the evaluation of the proposed ICA, problem data was generated to compare it against a genetic algorithm. The results of computational experiments show the good performance of the proposed algorithm.

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

[2]  F. Jolai,et al.  Optimal methods for batch processing problem with makespan and maximum lateness objectives , 2010 .

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

[4]  T. C. Edwin Cheng,et al.  Two-agent singe-machine scheduling with release times to minimize the total weighted completion time , 2013, Comput. Oper. Res..

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

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

[7]  Maghsoud Amiri,et al.  Synergy of ICA and MCDM for multi‐response optimisation problems , 2013 .

[8]  Maw-Sheng Chern,et al.  MINIMIZING THE MAKESPAN IN A SINGLE MACHINE SCHEDULING PROBLEM WITH A FLEXIBLE MAINTENANCE , 2002 .

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

[10]  Milad Yousefi,et al.  Minimising earliness and tardiness penalties in single machine scheduling against common due date using imperialist competitive algorithm , 2013 .

[11]  Morteza Kiani,et al.  An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem , 2014 .

[12]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

[14]  Liang Gao,et al.  A modified colonial competitive algorithm for the mixed-model U-line balancing and sequencing problem , 2012 .

[15]  Na Yi,et al.  Scheduling two agents with sum-of-processing-times-based deterioration on a single machine , 2013, Appl. Math. Comput..

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

[17]  W. J. Chen,et al.  Single-machine scheduling with periodic maintenance and nonresumable jobs , 2003, Comput. Oper. Res..

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

[19]  Fariborz Jolai,et al.  Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop , 2013 .

[20]  Jen-Shiang Chen,et al.  Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan , 2008, Eur. J. Oper. Res..

[21]  W. J. Chen,et al.  Minimizing total flow time in the single-machine scheduling problem with periodic maintenance , 2006, J. Oper. Res. Soc..

[22]  Chung-Yee Lee,et al.  Single machine flow-time scheduling with scheduled maintenance , 1992, Acta Informatica.

[23]  T. C. Edwin Cheng,et al.  Single-machine scheduling with periodic maintenance to minimize makespan , 2007, Comput. Oper. Res..

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

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

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

[27]  Guoqing Wang,et al.  Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times , 2005, Ann. Oper. Res..

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

[29]  Jacek Blazewicz,et al.  An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints , 2005, Eur. J. Oper. Res..

[30]  T.C.E. Cheng,et al.  Single machine scheduling with a restricted rate‐modifying activity , 2005 .

[31]  Mostafa Zandieh,et al.  Group scheduling in flexible flow shops: a hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism , 2011 .

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

[33]  Seyed Mohammad Hossein Hojjati,et al.  A particle swarm optimisation for time-dependent vehicle routing problem with an efficient travel time function , 2014 .

[34]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[35]  Liang Gao,et al.  Integrated process planning and scheduling using an imperialist competitive algorithm , 2012 .

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

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

[38]  Pisut Pongchairerks,et al.  Variable neighbourhood search algorithms for asymmetric travelling salesman problems , 2013 .

[39]  Qi Feng,et al.  A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives , 2013 .

[40]  Genichii Taguchi,et al.  Introduction to quality engineering. designing quality into products a , 1986 .

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

[42]  Ghafour Ahani,et al.  A tabu search algorithm for no-wait job shop scheduling problem , 2014 .

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

[44]  Chandrasekharan Rajendran,et al.  An improved ant-colony algorithm for the grouping of machine-cells and part-families in cellular manufacturing systems , 2013 .

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

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

[47]  Wen-Chiung Lee,et al.  A single-machine scheduling problem with two-agent and deteriorating jobs , 2010 .

[48]  J. S. Chen,et al.  Single-machine scheduling with flexible and periodic maintenance , 2006, J. Oper. Res. Soc..

[49]  T. C. Edwin Cheng,et al.  Scheduling linear deteriorating jobs with an availability constraint on a single machine , 2006, Theor. Comput. Sci..

[50]  Yu-Hsiang Chung,et al.  Genetic algorithms for a two-agent single-machine problem with release time , 2012, Appl. Soft Comput..

[51]  Hamid Reza Golmakani,et al.  An artificial immune algorithm for multiple-route job shop scheduling problem , 2012, The International Journal of Advanced Manufacturing Technology.

[52]  Chin-Chia Wu,et al.  An investigation on a two-agent single-machine scheduling problem with unequal release dates , 2012, Comput. Oper. Res..

[53]  Jen-Shiang Chen,et al.  Optimization models for the machine scheduling problem with a single flexible maintenance activity , 2006 .

[54]  Der-Chiang Li,et al.  Solving a two-agent single-machine scheduling problem considering learning effect , 2012, Comput. Oper. Res..

[55]  E. Shokrollahpour,et al.  A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem , 2011 .

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

[57]  Wen-Chiung Lee,et al.  Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine , 2003, Inf. Process. Lett..

[58]  Chin-Chia Wu,et al.  A study of the single-machine two-agent scheduling problem with release times , 2013, Appl. Soft Comput..