Pages that link to "Item:Q853793"
From MaRDI portal
The following pages link to Scheduling equal processing time jobs to minimize the weighted number of late jobs (Q853793):
Displaying 10 items.
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs (Q839781) (← links)
- Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines (Q1702729) (← links)
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (Q1964481) (← links)
- Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Time-of-use scheduling problem with equal-length jobs (Q6111939) (← links)
