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

DOI10.1016/J.EJOR.2015.04.006zbMATH Open1346.90358OpenAlexW2059543744MaRDI QIDQ319703FDOQ319703

Authors: C. 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)

Cites Work

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

Cited In (1)

• Mirror scheduling problems with early work and late work criteria

This page was built for publication: A note on scheduling problems with competing agents and earliness minimization objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319703)