Computing and Combinatorics

Volume 5092 of the series Lecture Notes in Computer Science pp 642-650

Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine

  • Peng LiuAffiliated withThe Logistics Institute, Northeastern University
  • , Lixin TangAffiliated withThe Logistics Institute, Northeastern University

* Final gross prices may vary according to local VAT.

Get Access


This paper considers the two-agent scheduling problems with linear deteriorating jobs to be processed on a single machine. By a deteriorating job we mean that the processing time of the job is a function of its starting time. Two agents compete for the usage of a common single machine and each agent has his own criterion to optimize. There are four objective functions: makespan, maximum lateness, maximum cost, and total completion time. Some basic properties of two different scheduling problems to minimize the objective function for one agent with a constraint on the other agent’s objective function are proved. Based on these properties, the optimal algorithms with polynomial time are presented for two different scheduling problems, respectively.