A new neuro-dominance rule for single machine tardiness problem

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Çakar, T. (2005). A new neuro-dominance rule for single machine tardiness problem. In Lecture Notes in Computer Science (Vol. 3483, pp. 1241–1250). Springer Verlag. https://doi.org/10.1007/11424925_129

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free