An effective lower bound on L_ in a worker-constrained job shop
DOI10.1016/J.COR.2012.07.003zbMATH Open1349.90378OpenAlexW2110729969WikidataQ57429547 ScholiaQ57429547MaRDI QIDQ339585FDOQ339585
Authors: Benjamin J. Lobo, Thom J. Hodgson, Russell E. King, Kristin A. Thoney, James R. Wilson 
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
Recommendations
- A new lower bound for the job-shop scheduling problem
- Minimizing L max for large-scale, job-shop scheduling problems
- Lower bounds for the job-shop scheduling problem on multi-purpose machines
- Lagrangian bounds for just-in-time job-shop scheduling
- Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
- Multiple-machine lower bounds for shop-scheduling problems
- scientific article; zbMATH DE number 4143765
- A lower bound for the job insertion problem.
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Scheduling. Theory, algorithms, and systems.
- The deployment scheduling analysis tool (DSAT)
- Computational Complexity of Discrete Optimization Problems
- Benchmarks for shop scheduling problems
- Fifty years of scheduling: a survey of milestones
- An Algorithm for Solving the Job-Shop Problem
- Some simple scheduling algorithms
- Modeling simultaneous worker learning and forgetting in dual resource constrained systems
- 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
- Title not available (Why is that?)
- Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics
- Title not available (Why is that?)
- Scheduling research in multiple resource constrained job shops: a review and critique
- Sequencing with due-dates and early start times to minimize maximum tardiness
- Minimizing L max for large-scale, job-shop scheduling problems
Cited In (4)
- Minimizing L max for large-scale, job-shop scheduling problems
- Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
- A lower bound for the job insertion problem.
Uses Software
This page was built for publication: An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339585)
