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

DOI10.1007/S40305-012-0002-7zbMath1281.90041OpenAlexW1983854422MaRDI QIDQ384219

Dong-lei Du, Da-Chuan Xu

Publication date: 27 November 2013

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-012-0002-7

zbMATH Keywords

schedulingapproximation algorithmbi-criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• An improved lower bound for a bi-criteria scheduling problem
• 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 almost tight lower bound for the scheduling problem to meet two min-sum objectives