A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration

In this paper, we consider minimizing total weighted completion time criteria on a single machine. Jobs processing times are step function of its starting time and all jobs have a common due date. First, we present some new lemmas and dominance properties for this NP-hard problem, and then a memetic algorithm using these properties is developed. We compare the solutions of the memetic algorithm with optimal solutions obtained from complete enumeration. The results show that the average percentage error of the proposed algorithm from optimal solutions is about 2% and as the variance of processing time increase, the percentage errors decrease.

[1]  T. C. Edwin Cheng,et al.  Single machine scheduling with step-deteriorating processing times , 2001, Eur. J. Oper. Res..

[2]  Bertrand M. T. Lin,et al.  Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs , 2005, Comput. Oper. Res..

[3]  Pablo Moscato,et al.  A memetic algorithm for the total tardiness single machine scheduling problem , 2001, Eur. J. Oper. Res..

[4]  Ling Wang,et al.  Scheduling multi-objective job shops using a memetic algorithm based on differential evolution , 2008 .

[5]  Bertrand M. T. Lin,et al.  A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..

[6]  Mitsuo Gen,et al.  Parallel machine scheduling problems using memetic algorithms , 1997 .

[7]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[8]  William E. Hart,et al.  Recent Advances in Memetic Algorithms , 2008 .

[9]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[10]  Zhi-Long Chen,et al.  A note on single-processor scheduling with time-dependent execution times , 1995, Oper. Res. Lett..

[11]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[12]  Edmund K. Burke,et al.  Hybrid evolutionary techniques for the maintenance scheduling problem , 2000 .

[13]  Anand S. Kunnathur,et al.  Optimal repayment policies for multiple loans , 1987 .

[14]  Gur Mosheiov,et al.  Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine , 1995 .

[15]  P. S. Sundararaghavan,et al.  Single machine scheduling with start time dependent processing times: Some solvable cases , 1994 .

[16]  Sushil K. Gupta,et al.  Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem , 1990 .

[17]  Masoud Rabbani,et al.  Determination of number of kanbans in a supply chain system via Memetic algorithm , 2009, Adv. Eng. Softw..

[18]  Gur Mosheiov,et al.  Scheduling jobs under simple linear deterioration , 1994, Comput. Oper. Res..

[19]  T. C. Edwin Cheng,et al.  Single machine scheduling with deadlines and increasing rates of processing times , 2000, Acta Informatica.

[20]  V. Tanaev,et al.  Scheduling theory single-stage systems , 1994 .

[21]  Bernd Freisleben,et al.  Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning , 2000, Evolutionary Computation.

[22]  Jatinder N. D. Gupta,et al.  Single facility scheduling with nonlinear processing times , 1988 .

[23]  Bertrand M. T. Lin,et al.  Makespan minimization in single-machine scheduling with step-deterioration of processing times , 2004, J. Oper. Res. Soc..

[24]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[25]  Wieslaw Kubiak,et al.  Scheduling deteriorating jobs to minimize makespan , 1998 .

[26]  Peter Merz,et al.  Memetic algorithms for combinatorial optimization problems : fitness landscapes and effective search strategies , 2006 .