Pages that link to "Item:Q1364482"
From MaRDI portal
The following pages link to A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (Q1364482):
Displayed 6 items.
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075) (← links)
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067) (← links)
