Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates

The considered problem is the scheduling of a set of jobs on identical parallel machines in order to minimize the total tardiness without any preemption or splitting. Each job has its own processing time, release date and due date. All the machines are considered identical (with same speed) and available during all the scheduling period. This problem is NP-hard. An exact resolution, an Ant Colony Algorithm (ACO), a Tabu Search (TS) method, a set of Heuristics based on priority rules and an adapted Biskup Hermann Gupta (BHG) method are proposed to solve the problem. The obtained results are discussed and analyzed.

[1]  Vincenzo De Florio,et al.  Technological Innovations in Adaptive and Dependable Systems: Advancing Models and Concepts , 2012 .

[2]  Vinícius Amaral Armentano,et al.  Tabu search for scheduling on identical parallel machines to minimize mean tardiness , 2000, J. Intell. Manuf..

[3]  Yeong-Dae Kim,et al.  A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property , 2008, Comput. Oper. Res..

[4]  Chengbin Chu,et al.  Parallel machine scheduling to minimize total tardiness , 2002 .

[5]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .

[6]  Reza Tavakkoli-Moghaddam,et al.  A fuzzy-mixed-integer goal programming model for a parallel-machine scheduling problem with sequence-dependent setup times and release dates , 2007 .

[7]  Christos Koulamas.  Polynomially solvable total tardiness problems: Review and extensions , 1997 .

[8]  Eugene L. Lawler.  On Scheduling Problems with Deferral Costs , 1964 .

[9]  J. Karlsson.  Low-Complexity Encoding in Block-Based Hybrid Video Codecs by Moving Motion Estimation to Decoder Side , 2014, Int. J. Adapt. Resilient Auton. Syst..

[10]  Massimo Paolucci,et al.  Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach , 2007, Comput. Oper. Res..

[11]  Christos Koulamas,et al.  A heuristic for the single machine tardiness problem , 1993 .

[12]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[13]  C. Chu.  A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

[14]  Kun-si Lin.  Scheduling with parallel machines to minimize total job tardiness , 1981 .

[15]  Cláudia Quaresma,et al.  Intelligent Chair Sensor: Classification and Correction of Sitting Posture , 2014, Int. J. Syst. Dyn. Appl..

[16]  Jwm Will Bertrand,et al.  A dynamic priority rule for scheduling against due-dates , 1982 .

[17]  Yeong-Dae Kim,et al.  Scheduling on parallel identical machines to minimize total tardiness , 2007, Eur. J. Oper. Res..

[18]  Yih-Long Chang,et al.  Heuristics for minimizing mean tardiness form parallel machines , 1991 .

[19]  Bahram Alidaee,et al.  Scheduling parallel machines to minimize total weighted and unweighted tardiness , 1997, Comput. Oper. Res..

[20]  Lars Taxén.  Using Activity Domain Theory for Managing Complex Systems , 2009 .

[21]  Jatinder N. D. Gupta,et al.  Scheduling identical parallel machines to minimize total tardiness , 2008 .

[22]  Lars Taxén.  Enterprise Architectures: An Alternative View , 2010 .

[23]  James G. Root.  Scheduling with Deadlines and Loss Functions on k Parallel Machines , 1965 .

[24]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[25]  Francky Catthoor,et al.  Reliability-Aware Proactive Energy Management in Hard Real-Time Systems: A Motivational Case Study , 2010, Int. J. Adapt. Resilient Auton. Syst..

[26]  Wei-Chiang Samuelson Hong.  Principal Concepts in Applied Evolutionary Computation: Emerging Trends , 2012 .

[27]  Rashid A. Alammari,et al.  Park's Transformation for Electric Power Quality Recognition and Classification in Distribution Networks , 2012, Int. J. Syst. Dyn. Appl..

[28]  Furkan Kiraç,et al.  A tabu search algorithm for parallel machine total tardiness problem , 2004, Comput. Oper. Res..

[29]  Kinshuk,et al.  Intelligent and Adaptive Learning Systems: Technology Enhanced Support for Learners and Teachers , 2011 .

[30]  Christos Koulamas.  Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem , 1997 .

[31]  J. D. Irwin,et al.  An Improved Method for Scheduling Independent Tasks , 1971 .

[32]  Salah E. Elmaghraby,et al.  On the Scheduling of Jobs on a Number of Identical Machines. , 1972 .

[33]  Olac Fuentes,et al.  Using Evolution Strategies to perform stellar population synthesis for galaxy spectra from SDSS , 2007, 2007 IEEE Congress on Evolutionary Computation.

[34]  Julius Surkis,et al.  Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors , 1979 .

[35]  Lionel Amodeo,et al.  Hybrid Job Shop and Parallel Machine Scheduling Problems: Minimization of Total Tardiness Criterion , 2007 .

[36]  M. Azizoglu,et al.  Tardiness minimization on parallel machines , 1998 .

[37]  Shunji Tanaka,et al.  A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines , 2008 .

[38]  Antoine Jouglet,et al.  Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates , 2011, Comput. Oper. Res..

[39]  Yan Chen,et al.  Scheduling jobs on parallel machines with setup times and ready times , 2008, Comput. Ind. Eng..

[40]  Marie-Christine Jaulent,et al.  Clinical Practice Guidelines Formalization for Personalized Medicine , 2013, Int. J. Appl. Evol. Comput..

[41]  Shouyang Wang,et al.  A New Back-Propagation Neural Network Algorithm for a Big Data Environment Based on Punishing Characterized Active Learning Strategy , 2013, Int. J. Knowl. Syst. Sci..

[42]  Steven Guan,et al.  Incremental Hyperplane Partitioning for Classification , 2013, Int. J. Appl. Evol. Comput..