Minimizing Total Weighted Tardiness in a Generalized Job Shop
- 1 December 2005
- journal article
- Published by Springer Nature in Journal of Scheduling
- Vol. 8 (6) , 479-496
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A large step random walk for minimizing total weighted tardiness in a job shopJournal of Scheduling, 2000
- A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shopNaval Research Logistics (NRL), 1999
- A Fast Taboo Search Algorithm for the Job Shop ProblemManagement Science, 1996
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Scheduling Tasks with Due Dates in a Fabrication/Assembly ProcessOperations Research, 1987
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956