A New Neuro-Dominance Rule for Single Machine Tardiness Problem

We present a neuro-dominance rule for single machine total weighted tardiness problem. To obtain the neuro-dominance rule (NDR), backpropagation artificial neural network (BPANN) has been trained using 5000 data and also tested using 5000 another data. The proposed neuro-dominance rule provides a sufficient condition for local optimality. It has been proved that if any sequence violates the neuro-dominance rule then violating jobs are switched according to the total weighted tardiness criterion. The proposed neuro-dominance rule is compared to a number of competing heuristics and meta heuristics for a set of randomly generated problems. Our computational results indicate that the neuro-dominance rule dominates the heuristics and meta heuristics in all runs. Therefore, the neuro-dominance rule can improve the upper and lower bounding schemes.

[1]  W. Szwarc.  Adjacent orderings in single-machine scheduling with earliness and tardiness penalties , 1993 .

[2]  John B. Jensen,et al.  Evaluation of scheduling rules with commensurate customer priorities in job shops , 1995 .

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

[4]  Timothy J. Lowe,et al.  Dominance and Decomposition Heuristics for Single Machine Scheduling , 1991, Oper. Res..

[5]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

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

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

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

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

[10]  Han Hoogeveen,et al.  Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems , 1992, Math. Program..

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

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

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

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

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

[16]  Joseph Y-T. Leung.  Branch-and-Bound Algorithms for Total Weighted Tardiness , 2004 .

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

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