Pages that link to "Item:Q2819572"
From MaRDI portal
The following pages link to Makespan minimization in job shops (Q2819572):
Displayed 5 items.
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
- An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259) (← links)