A note on scheduling problems with competing agents and earliness minimization objectives

DOI10.1016/j.ejor.2015.04.006zbMath1346.90358OpenAlexW2059543744MaRDI QIDQ319703

Christos P. Koulamas

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.04.006

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Mirror scheduling problems with early work and late work criteria

Cites Work

• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• Multi-agent single machine scheduling
• Competitive Two-Agent Scheduling and Its Applications
• Minimizing Total Tardiness on One Machine is NP-Hard
• Scheduling Problems with Two Competing Agents