Pages that link to "Item:Q1399579"
From MaRDI portal
The following pages link to Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579):
Displayed 3 items.
- On minimizing the weighted number of late jobs in unit execution time open-shops. (Q1399578) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines (Q5945391) (← links)