Minimizing L max for large-scale, job-shop scheduling problems
From MaRDI portal
Publication:4671351
DOI10.1080/00207540410001721754zbMath1060.90047OpenAlexW2112862921MaRDI QIDQ4671351
Simon R. Schultz, Thom J. Hodgson, Russell E. King, Kristin A. Thoney
Publication date: 26 April 2005
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540410001721754
Related Items
Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics, An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
Cites Work
- Benchmarks for shop scheduling problems
- Job shop scheduling with deadlines
- Insertion techniques for the heuristic solution of the job shop problem
- Some new results on simulated annealing applied to the job shop scheduling problem
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Applying tabu search to the job-shop scheduling problem
- Note. Satisfying Due Dates in Large Job Shops
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Fast Taboo Search Algorithm for the Job Shop Problem