Pages that link to "Item:Q2884494"
From MaRDI portal
The following pages link to Multiple-machine lower bounds for shop-scheduling problems (Q2884494):
Displaying 10 items.
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop (Q339585) (← links)
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
- Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results (Q814422) (← links)
- New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
- Lower bounds for the job-shop scheduling problem on multi-purpose machines (Q1805453) (← links)
- Multi-machine scheduling lower bounds using decision diagrams (Q2294251) (← links)
- Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop (Q2890475) (← links)
- Bounds for naive multiple machine scheduling with release times and deadlines (Q3319773) (← links)
- Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties (Q5242361) (← links)