A Note on Two-agent Single-machine Scheduling Problem with Deteriorating Jobs
This paper considers the two-agent scheduling problems with decreasing linear deterioration on a single machine. Two agents compete to perform their respective jobs on a common single machine, and each agent has his own criterion to optimize. The processing times of jobs are defined as a decreasing linear function of their starting times. The goal is to minimize the maximum cost of the first agent with the restriction that the makespan of the second agent cannot exceed a given upper bound. We propose the optimal properties and present the optimal polynomial time algorithm to solve the scheduling problem.
Scheduling Two-agent Deteriorating jobs Single machine
Peng Liu Daguang Feng Xiaoye Zhou Qi Tang
School of Management, Shenyang University of Technology, Shenyang, 110870, China Science of Institute, Shenyang Agricultural University, Shenyang, China, 110866
国际会议
The 22nd China Control and Decision Conference(2010年中国控制与决策会议)
徐州
英文
3832-3835
2010-05-26（万方平台首次上网日期，不代表论文的发表时间）