Pages that link to "Item:Q600835"
From MaRDI portal
The following pages link to Polynomial-time approximation schemes for scheduling problems with time lags (Q600835):
Displaying 8 items.
- Two-machine interval shop scheduling with time lags (Q892834) (← links)
- A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays (Q1306465) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Coupled task scheduling with exact delays: literature review and models (Q2282490) (← links)
- Optimal appointment scheduling in continuous time: the lag order approximation method (Q2629621) (← links)
- Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks (Q2883631) (← links)
- Link scheduling in polynomial time (Q3826350) (← links)
- (Q4527315) (← links)