Pages that link to "Item:Q2283295"
From MaRDI portal
The following pages link to Parameterized complexity of a coupled-task scheduling problem (Q2283295):
Displayed 10 items.
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Scheduling coupled tasks with exact delays for minimum total job completion time (Q2061138) (← links)
- Coupled task scheduling with time-dependent processing times (Q2061140) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
- Coupled task scheduling with exact delays: literature review and models (Q2282490) (← links)
- (Q6068238) (← links)
- (Q6089672) (← links)
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times (Q6179222) (← links)