Pages that link to "Item:Q1702732"
From MaRDI portal
The following pages link to Normal-form preemption sequences for an open problem in scheduling theory (Q1702732):
Displaying 7 items.
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- Rational preemptive scheduling (Q1105366) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← 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)
- How small are shifts required in optimal preemptive schedules? (Q2341389) (← links)