Single machine batch scheduling with two competing agents to minimize total flowtime


We study a single machine scheduling problem, where two agents compete on the use of a single processor. Each of the agents needs to process a set of jobs in order to optimize his objective function. We focus on a two-agent problem in the context of batch scheduling. We assume identical jobs and identical (agent-dependent) setup times. The objective… (More)
DOI: 10.1016/j.ejor.2011.06.037


7 Figures and Tables