An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
From MaRDI portal
Publication:339585
DOI10.1016/j.cor.2012.07.003zbMath1349.90378OpenAlexW2110729969WikidataQ57429547 ScholiaQ57429547MaRDI QIDQ339585
Benjamin J. Lobo, James R. Wilson, Thom J. Hodgson, Kristin A. Thoney, Russell E. King
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.07.003
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics
- Modeling simultaneous worker learning and forgetting in dual resource constrained systems
- Benchmarks for shop scheduling problems
- The deployment scheduling analysis tool (DSAT)
- Note. Satisfying Due Dates in Large Job Shops
- Examination of flexibility acquisition policies in dual resource constrained job shops with simultaneous worker learning and forgetting effects
- Fifty years of scheduling: a survey of milestones
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Computational Complexity of Discrete Optimization Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling research in multiple resource constrained job shops: a review and critique
- Some simple scheduling algorithms
- Sequencing with due-dates and early start times to minimize maximum tardiness
- Minimizing L max for large-scale, job-shop scheduling problems
- Scheduling
This page was built for publication: An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
