Pages that link to "Item:Q4207781"
From MaRDI portal
The following pages link to Approximation scheduling algorithms: a survey (Q4207781):
Displaying 8 items.
- Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function (Q1310024) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- Analysis of the twisting department at superior cable corporation: A case study (Q1809862) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- A survey of methods for the solution of problems of scheduling theory (Q2718206) (← links)
- An experimental study of LP-based approximation algorithms for scheduling problems (Q2890462) (← links)
- (Q3142061) (← links)
- Approximation algorithms for scheduling with reservations (Q5961975) (← links)