Pages that link to "Item:Q5945391"
From MaRDI portal
The following pages link to On preemption redundancy in scheduling unit processing time jobs on two parallel machines (Q5945391):
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)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- How useful are preemptive schedules? (Q1413904) (← links)
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time (Q1617277) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293) (← links)
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← links)
- How small are shifts required in optimal preemptive schedules? (Q2341389) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
