A note on scheduling to meet two min-sum objectives

DOI10.1016/J.ORL.2006.01.004zbMath1145.90016OpenAlexW2019167767MaRDI QIDQ2643821

Eric Angel, Evripidis Bampis, Aleksei V. Fishkin

Publication date: 27 August 2007

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2006.01.004

zbMATH Keywords

schedulingcompletion timemin-sum objectives

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

An almost tight lower bound for the scheduling problem to meet two min-sum objectives ⋮ An improved lower bound for a bi-criteria scheduling problem ⋮ Bi-objective matchings with the triangle inequality ⋮ Approximation algorithms for the bi-criteria weighted MAX-CUT problem ⋮ Approximation algorithms for multi-agent scheduling to minimize total weighted completion time ⋮ Two dimensional load balancing ⋮ An approximation scheme for the bi-scenario sum of completion times trade-off problem ⋮ A new approach for bicriteria partitioning problem

Cites Work

• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on scheduling to meet two min-sum objectives