Pages that link to "Item:Q4025912"
From MaRDI portal
The following pages link to Minimizing Total Tardiness on a Single Machine with Precedence Constraints (Q4025912):
Displayed 7 items.
- Scheduling with bully selfish jobs (Q692928) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)