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 12 items.
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs (Q839781) (← links)
- Scheduling equal processing time jobs to minimize the weighted number of late jobs (Q853793) (← links)
- A note on the two machine job shop with the weighted late work criterion (Q880589) (← links)
- Total completion time minimization in two-machine job shops with unit-time operations (Q1278312) (← 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)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Scheduling shops to minimize the weighted number of late jobs (Q1890952) (← links)
- On the complexity of minimizing the number of late jobs in unit time open shop (Q1962026) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- (Q3754430) (← links)
