Multiple-machine lower bounds for shop-scheduling problems
From MaRDI portal
Recommendations
- Lower bounds for the job-shop scheduling problem on multi-purpose machines
- A new lower bound for the job-shop scheduling problem
- An assignment-based lower bound for a class of two-machine flow shop problems
- Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop
- Bounding strategies for the hybrid flow shop scheduling problem
Cited in
(11)- Lower bounds for the job-shop scheduling problem on multi-purpose machines
- Multi-machine scheduling lower bounds using decision diagrams
- A new lower bound for the job-shop scheduling problem
- Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop
- Bounds for naive multiple machine scheduling with release times and deadlines
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties
- Bounding strategies for the hybrid flow shop scheduling problem
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- New single machine and job-shop scheduling problems with availability constraints
This page was built for publication: Multiple-machine lower bounds for shop-scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884494)
