An Intelligent Algorithm for Scheduling Jobs on a Single Machine with a Common Due Date

In this paper, an intelligent algorithm for scheduling jobs on a single machine with a common due date is introduced. This problem of scheduling jobs on a single machine, known as NP-complete problem, is against the common due date with respect to earliness and tardiness penalties. In the proposed algorithm, the properties of scheduling jobs on a single machine with a common due date are well derived with ant colony optimization (ACO). Furthermore, the heuristic is embedded into ACO as local search to escape from local optima. Simulation results show that the proposed intelligent algorithm yields the best performance among existing algorithms.

[1]  Jatinder N. D. Gupta,et al.  Two-Machine Flow Shop Scheduling with Nonregular Criteria , 2004, J. Math. Model. Algorithms.

[2]  Chengbin Chu,et al.  A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..

[3]  Chou-Yuan Lee,et al.  A hybrid search algorithm with heuristics for resource allocation problem , 2005, Inf. Sci..

[4]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[5]  S. Su,et al.  Ant colonies with cooperative process applied to the resource allocation problem , 2005 .

[6]  Ranjan Bose,et al.  Information theory, coding and cryptography , 2003 .

[7]  Suresh P. Sethi,et al.  Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..

[8]  E. Jaynes.  On the rationale of maximum-entropy methods , 1982, Proceedings of the IEEE.

[9]  Anup K. Sen,et al.  Single machine weighted earliness-tardiness penalty problem with a common due date , 2001, Comput. Oper. Res..

[10]  Martin Feldmann,et al.  Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches , 2003 .

[11]  Ross J. W. James.  Using tabu search to solve the common due date early/tardy machine scheduling problem , 1997, Comput. Oper. Res..

[12]  Martin Feldmann,et al.  Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates , 2001, Comput. Oper. Res..

[13]  Naoki Katoh,et al.  Resource Allocation Problems , 1998 .

[14]  Liu Min,et al.  Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems , 2006 .

[15]  Toshihide Ibaraki,et al.  Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[16]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[17]  Shuo-Yan Chou,et al.  Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date , 2007, J. Heuristics.

[18]  H. G. Kahlbacher.  Scheduling with monotonous earliness and tardiness penalties , 1993 .

[19]  W. Szwarc.  Single-machine scheduling to minimize absolute deviation of completion times from a common due date , 1989 .

[20]  Chae Y. Lee,et al.  Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights , 1995 .

[21]  Shuo-Yan Chou,et al.  A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date , 2007, Eur. J. Oper. Res..

[22]  Madabhushi Raghavachari,et al.  A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions , 1993, Comput. Oper. Res..

[23]  J. A. Hoogeveen,et al.  Scheduling around a small common due date , 1991 .

[24]  Débora P. Ronconi,et al.  Minimizing earliness and tardiness penalties in a single-machine problem with a common due date , 2005, Eur. J. Oper. Res..

[25]  Ching-Fang Liaw,et al.  A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem , 1999, Comput. Oper. Res..