Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine

Lixin Tang, Xiaoli Zhao, Jiyin Liu, Joseph Y.T. Leung

Research output: Contribution to journalArticlepeer-review

36 Scopus citations


We consider a scheduling problem in which the jobs are generated by two agents and have time-dependent proportional-linear deteriorating processing times. The two agents compete for a common single batching machine to process their jobs, and each agent has its own criterion to optimize. The jobs may have identical or different release dates. The batching machine can process several jobs simultaneously as a batch and the processing time of a batch is equal to the longest of the job processing times in the batch. The problem is to determine a schedule for processing the jobs such that the objective of one agent is minimized, while the objective of the other agent is maintained under a fixed value. For the unbounded model, we consider various combinations of regular objectives on the basis of the compatibility of the two agents. For the bounded model, we consider two different objectives for incompatible and compatible agents: minimizing the makespan of one agent subject to an upper bound on the makespan of the other agent and minimizing the number of tardy jobs of one agent subject to an upper bound on the number of tardy jobs of the other agent. We analyze the computational complexity of various problems by either demonstrating that the problem is intractable or providing an efficient exact algorithm for the problem. Moreover, for certain problems that are shown to be intractable, we provide efficient algorithms for certain special cases.

Original languageEnglish (US)
Pages (from-to)401-411
Number of pages11
JournalEuropean Journal of Operational Research
Issue number2
StatePublished - Dec 1 2017

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


  • Agent scheduling
  • Deterioration
  • Parallel-batching
  • Release dates
  • Scheduling


Dive into the research topics of 'Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine'. Together they form a unique fingerprint.

Cite this