 Single machine batch scheduling with two competing agents to minimize total flowtimeBaruch Mor and Gur Mosheiov European Journal of Operational Research, 2011, vol. 215, issue 3, 524-531 Abstract: 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 function is minimizing the flowtime of one agent subject to an upper bound on the flowtime of the second agent. As in many real-life applications, we restrict ourselves to settings where the batches of the second agent must be processed continuously. Thus, the batch sizes are partitioned into three parts, starting with a sequence of the first agent, followed by a sequence of the second agent, and ending by another sequence of the first agent. In an optimal schedule, all three are shown to be decreasing arithmetic sequences. We introduce an efficient solution algorithm (where n is the total number of jobs). Keywords: Two-agent; scheduling; Batch; scheduling; Single; machine; Flowtime (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:215:y:2011:i:3:p:524-531 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.