Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
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 agents objective function are proved. Based on these properties, the optimal algorithms with polynomial time are presented for two different scheduling problems, respectively.
Peng Liu Lixin Tang
The Logistics Institute, Northeastern University, Shenyang, China The Logistics Institute, Northeastern University, Shenyang,China
国际会议
The 4th Annual International Computing and Combinatorics Conference,COCOON 2008(第14届国际计算和组合会议)
大连
英文
642-650
2008-06-01（万方平台首次上网日期，不代表论文的发表时间）