A flexible dispatching rule for minimizing tardiness in job shop scheduling
Authors:
- Binchao ChenBCBinchao Chen
- Timothy I. MatisTMTimothy I. Matis
- 1 January 2013
- journal article
- Published by Elsevier in International Journal of Production Economics
- Vol. 141 (1) , 360-365
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Solving Scheduling Problems by Simulated AnnealingSIAM Journal on Control and Optimization, 1998
- Solving the job shop scheduling problem with tabu searchIIE Transactions, 1995
- A branch and bound algorithm for the job-shop scheduling problemDiscrete Applied Mathematics, 1994
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- Two new rules to minimize tardiness in a job shopInternational Journal of Production Research, 1990
- A survey of priority rule-based schedulingOR Spectrum, 1989
- Sequencing Rules and Due-Date Assignments in a Job ShopManagement Science, 1984
- A state-of-the-art survey of dispatching rules for manufacturing job shop operationsInternational Journal of Production Research, 1982
- Estimating Sample Size in Computing Simulation ExperimentsManagement Science, 1971
- Load Forecasting, Priority Sequencing, and Simulation in a Job Shop Control SystemManagement Science, 1966