Pages that link to "Item:Q1413904"
From MaRDI portal
The following pages link to How useful are preemptive schedules? (Q1413904):
Displaying 12 items.
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← links)
- Preemptive scheduling with simple linear deterioration on a single machine (Q708208) (← links)
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs (Q839781) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling (Q1999390) (← links)
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
- The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293) (← links)
- How small are shifts required in optimal preemptive schedules? (Q2341389) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- Preemptive scheduling in a two-stage supply chain to minimize the makespan (Q3458814) (← links)
