Single machine scheduling with unequal release date using neuro-dominance rule

A neuro-dominance rule (NDR) for single machine total weighted tardiness problem with unequal release date is presented by the author. To obtain the NDR, backpropagation artificial neural network (BPANN) has been trained using 10,000 data and also tested using 10,000 another data. Inputs of the trained BPANN are starting date of the first job (t), processing times (pi and pj), due dates (di and dj), weights of the jobs (wi and wj) and ri and rj release dates of the jobs. Output of the BPANN is a decision of which job should precede. Training set and test set have been obtained using Adjusted Pairwise Interchange method. The proposed NDR provides a sufficient condition for local optimality. It has been proved that if any sequence violates the NDR then violating jobs are switched according to the total weighted tardiness criterion. The proposed NDR is compared to a number of competing heuristics (ATC, COVERT, EDD, SPT, LPT, WDD, WSPT, WPD, CR, FCFS) and meta heuristics (simulated annealing and genetic algorithms) for a set of randomly generated problems. The problem sizes have been taken as 50, 70, 100. NDR is applied 270,000 randomly generated problems. Computational results indicate that the NDR dominates the heuristics and meta heuristics in all runs. Therefore, the NDR can improve the upper and lower bounding schemes.

[1]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[2]  Lucio Bianco,et al.  Scheduling of a single machine to minimize total weighted completion time subject to release dates , 1982 .

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

[4]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[5]  B. J. Lageweg,et al.  Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[6]  Gary R. Weckman,et al.  A neural network job-shop scheduler , 2008, J. Intell. Manuf..

[7]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

[8]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[9]  Doo Yong Lee,et al.  Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing , 1998, J. Intell. Manuf..

[10]  Jitender S. Deogun,et al.  Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time , 1981, SIAM J. Comput..

[11]  Tarık Çakar.  A New Neuro-Dominance Rule for Single Machine Tardiness Problem , 2005, ICCSA.

[12]  Ihsan Sabuncuoglu,et al.  A neural network model for scheduling problems , 1996 .

[13]  C. Chu,et al.  Some new efficient methods to solve the n/1/ri/ϵTi scheduling problem , 1992 .

[14]  Fred Glover,et al.  Tabu search methods for a single machine scheduling problem , 1991, J. Intell. Manuf..

[15]  W. Szwarc,et al.  Weighted Tardiness Single Machine Scheduling with Proportional Weights , 1993 .

[16]  Hing Kai Chan,et al.  Real time fuzzy scheduling rules in FMS , 2003, J. Intell. Manuf..

[17]  Ewa Dudek-Dyduch,et al.  Learning-based algorithms in scheduling , 2000, J. Intell. Manuf..

[18]  J. Erschler,et al.  A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates , 1983, Oper. Res..

[19]  M. Selim Akturk,et al.  Theory and Methodology a New Dominance Rule to Minimize Total Weighted Tardiness with Unequal Release Dates , 1998 .

[20]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

[21]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[22]  Chris N. Potts,et al.  Dynamic programming and decomposition approaches for the single machine total tardiness problem , 1987 .

[23]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

[24]  M. Selim Akturk,et al.  A new lower bounding scheme for the total weighted tardiness problem , 1998, Comput. Oper. Res..

[25]  Ram Mohan V. Rachamadugu,et al.  Technical Note - A Note on the Weighted Tardiness Problem , 1987, Oper. Res..

[26]  Tarik Çakar,et al.  A New Neuro-Dominance Rule for Single Machine Tardiness Problem with Unequal Release Dates , 2006, ICANN.

[27]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..