A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- 30 June 2011
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 38 (6), 967-983
- https://doi.org/10.1016/j.cor.2010.09.015
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problemComputers & Operations Research, 2008
- Minimizing Total Weighted Tardiness in a Generalized Job ShopJournal of Scheduling, 2005
- Decomposition methods for large job shopsComputers & Operations Research, 2001
- A large step random walk for minimizing total weighted tardiness in a job shopJournal of Scheduling, 2000
- Deterministic job-shop scheduling: Past, present and futureEuropean Journal of Operational Research, 1999
- A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shopNaval Research Logistics (NRL), 1999
- A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shopsIIE Transactions, 1998
- Priority Rules for Job Shops with Weighted Tardiness CostsManagement Science, 1987
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier BV ,1979
- Complexity of Machine Scheduling ProblemsPublished by Elsevier BV ,1977