Single machine scheduling with unequal release date using neuro-dominance rule
Author:
- 4 September 2009
- journal article
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 22 (4) , 481-490
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- A new dominance rule to minimize total weighted tardiness with unequal release datesEuropean Journal of Operational Research, 2001
- A new lower bounding scheme for the total weighted tardiness problemComputers & Operations Research, 1998
- A neural network model for scheduling problemsEuropean Journal of Operational Research, 1996
- Some new efficient methods to solve the n/1/ri/ϵTi scheduling problemEuropean Journal of Operational Research, 1992
- A survey of algorithms for the single machine total weighted tardiness scheduling problemDiscrete Applied Mathematics, 1990
- Dynamic programming and decomposition approaches for the single machine total tardiness problemEuropean Journal of Operational Research, 1987
- An algorithm for single machine sequencing with release dates to minimize total weighted completion timeDiscrete Applied Mathematics, 1983
- Scheduling of a single machine to minimize total weighted completion time subject to release datesNaval Research Logistics Quarterly, 1982
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow TimeSIAM Journal on Computing, 1981
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness1977