A procedure to compute a probabilistic bound for the maximum tardiness using stochastic simulation
- 1 January 2008
- journal article
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 41 (2) , 10534-10539
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A survey of priority rules for FMS scheduling and their performance for the benchmark problem2005
- Dynamic scheduling selection of dispatching rules for manufacturing systemInternational Journal of Production Research, 1997
- An expediting heuristic for the shortest processing time dispatching ruleInternational Journal of Production Research, 1989
- A comparative analysis of the COVERT job sequencing rule using various shop performance measuresInternational Journal of Production Research, 1987
- Sequencing Rules and Due-Date Assignments in a Job ShopManagement Science, 1984
- Job shop scheduling with modified due datesJournal of Operations Management, 1983
- A state-of-the-art survey of dispatching rules for manufacturing job shop operationsInternational Journal of Production Research, 1982
- A MODIFIED SI RULE IN JOB SHOP SCHEDULINGInternational Journal of Production Research, 1968