Scheduling with two competing agents to minimize total weighted earliness
Sign Up to like & getrecommendations! Published in 2017 at "Annals of Operations Research"
DOI: 10.1007/s10479-016-2310-5
Abstract: We study a single machine scheduling problem with two competing agents and earliness measures. Given a common deadline for all the jobs of both agents, the objective function is minimizing the total weighted earliness of… read more here.
Keywords: earliness; two competing; competing agents; dynamic programming ... See more keywords