scientific article; zbMATH DE number 1305545
From MaRDI portal
Publication:4252437
Cited in
(6)- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
- Randomized algorithms for on-line scheduling problems: How low can't you go?
- Designing PTASs for MIN-SUM scheduling problems
- A new approach for bicriteria partitioning problem
- Multicriteria scheduling
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252437)