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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Liu, P., & Tang, L. (2008). Two-agent scheduling with linear deteriorating jobs on a single machine. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5092 LNCS, pp. 642–650). https://doi.org/10.1007/978-3-540-69733-6_63
Mendeley helps you to discover research relevant for your work.