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


Cakar T.

JOURNAL OF INTELLIGENT MANUFACTURING, cilt.22, ss.481-490, 2011 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 22 Konu: 4
  • Basım Tarihi: 2011
  • Doi Numarası: 10.1007/s10845-009-0309-3
  • Dergi Adı: JOURNAL OF INTELLIGENT MANUFACTURING
  • Sayfa Sayıları: ss.481-490

Özet

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 (p(i) and p(j)), due dates (d(i) and d(j)), weights of the jobs (w(i) and w(j)) and r(i) and r(j) 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.