An improved lower bound for a bi-criteria scheduling problem

DOI10.1016/j.orl.2007.03.003zbMath1138.90008OpenAlexW2047252381MaRDI QIDQ924887

Jin Yan

Publication date: 29 May 2008

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

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

zbMATH Keywords

schedulinglower boundcompletion timeweighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

An almost tight lower bound for the scheduling problem to meet two min-sum objectives

Cites Work

• Unnamed Item
• Unnamed Item
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• A note on scheduling to meet two min-sum objectives

This page was built for publication: An improved lower bound for a bi-criteria scheduling problem