Scheduling with controllable processing times and compression costs using population-based heuristics

This paper considers the single machine scheduling problem of jobs with controllable processing times and compression costs and the objective to minimise the total weighted job completion time plus the cost of compression. The problem is known to be intractable, and therefore it was decided to be tackled by population-based heuristics namely differential evolution (DE), particle swarm optimisation (PSO), genetic algorithms (GAs), and evolution strategies (ES). Population-based heuristics have found wide application in most areas of production research including scheduling theory. It is therefore surprising that this problem has not yet received any attention from the corresponding heuristic algorithms community. This work aims at contributing to fill this gap. An appropriate problem representation scheme is developed together with a multi-objective procedure to quantify the trade-off between the total weighted job completion time and the cost of compression. The four heuristics are evaluated and compared over a large set of test instances ranging from five to 200 jobs. The experiments showed that a differential evolution algorithm is superior (with regard to the quality of the solutions obtained) and faster (with regard to the speed of convergence) to the other approaches.

[1]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[2]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[3]  Stanisaw Zdrzaka,et al.  Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis , 1991 .

[4]  Single machine scheduling with controllable processing times and compression costs (part i: equal times and costs) , 1998 .

[5]  Dvir Shabtay,et al.  A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..

[6]  Han Hoogeveen,et al.  Some Comments on Sequencing with Controllable Processing Times , 2002, Computing.

[7]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[8]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[9]  Alex A. Freitas,et al.  Evolutionary Computation , 2002 .

[10]  James Kennedy,et al.  The Behavior of Particles , 1998, Evolutionary Programming.

[11]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[12]  Raymond G. Vickson,et al.  Two Single Machine Sequencing Problems Involving Controllable Job Processing Times , 1980 .

[13]  Chung-Lun Li,et al.  Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard , 2001, Inf. Process. Lett..

[14]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[15]  T.C.E. Cheng,et al.  SINGLE-MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND EARLINESS, TARDINESS AND COMPLETION TIME PENALTIES , 1999 .

[16]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[17]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[18]  R. G. Vickson,et al.  Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine , 1980, Oper. Res..

[19]  J. C. Bean.  Genetics and random keys for sequencing amd optimization , 1993 .

[20]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[21]  Jan Karel Lenstra,et al.  Perspectives on parallel computing , 1989 .

[22]  S. S. Panwalkar,et al.  Single-machine sequencing with controllable processing times , 1992 .

[23]  Andreas C. Nearchou,et al.  Meta-heuristics from nature for the loop layout design problem , 2006 .

[24]  Han Hoogeveen,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[25]  Eugeniusz Nowicki,et al.  A survey of results for sequencing problems with controllable processing times , 1990, Discret. Appl. Math..

[26]  Bahram Alidaee,et al.  Two parallel machine sequencing problems involving controllable job processing times , 1993 .

[27]  Rakesh K. Sarin,et al.  Technical Note - Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy , 1989, Oper. Res..

[28]  K. R. Baker,et al.  A bicriterion approach to time/cost trade-offs in sequencing , 1982 .

[29]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[30]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[31]  Michael N. Vrahatis,et al.  Recent approaches to global optimization problems through Particle Swarm Optimization , 2002, Natural Computing.