Dynamic parallel machine scheduling with mean weighted tardiness objective by Q-Learning
- 30 August 2006
- journal article
- research article
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 34 (9-10) , 968-980
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted TardinessJournal of Scheduling, 2004
- Unrelated parallel machine scheduling with setup times and a total weighted tardiness objectiveRobotics and Computer-Integrated Manufacturing, 2003
- Scheduling unrelated parallel machines to minimize total weighted tardinessComputers & Operations Research, 2003
- Scheduling Jobs on Parallel Machines with Sequence-Dependent Family Set-up TimesThe International Journal of Advanced Manufacturing Technology, 2002
- Improved heuristics for the n-job single-machine weighted tardiness problemComputers & Operations Research, 1999
- A heuristic to minimize the total weighted tardiness with sequence-dependent setupsIIE Transactions, 1997
- Markov Decision Processes1994
- A comparative analysis of the COVERT job sequencing rule using various shop performance measuresInternational Journal of Production Research, 1987
- Priority Rules for Job Shops with Weighted Tardiness CostsManagement Science, 1987
- A dynamic priority rule for scheduling against due‐datesJournal of Operations Management, 1982