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 12 items.
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- On minimizing the weighted number of late jobs in unit execution time open-shops. (Q1399578) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- Open-shop scheduling for unit jobs under precedence constraints (Q5919300) (← links)
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines (Q5945391) (← links)