Pages that link to "Item:Q2098029"
From MaRDI portal
The following pages link to Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029):
Displaying 5 items.
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines (Q2691455) (← links)
- (Q5702311) (← links)
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times (Q6179222) (← links)
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (Q6547130) (← links)
- Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing (Q6556084) (← links)