Pages that link to "Item:Q1962067"
From MaRDI portal
The following pages link to Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067):
Displaying 5 items.
- 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)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
