Improving local search heuristics for some scheduling problems. Part II
- 10 January 1997
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 72 (1-2), 47-69
- https://doi.org/10.1016/s0166-218x(96)00036-4
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Improving local search heuristics for some scheduling problems—IDiscrete Applied Mathematics, 1996
- The complexity of one-machine batching problemsDiscrete Applied Mathematics, 1993
- Large-step markov chains for the TSP incorporating local search heuristicsOperations Research Letters, 1992
- Job Shop Scheduling by Simulated AnnealingOperations Research, 1992
- Batch sizing and job sequencing on a single machineAnnals of Operations Research, 1990
- Sequencing to Minimize the Maximum Job CostOperations Research, 1980
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence ConstraintsPublished by Elsevier ,1978
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954