A Single-machine Scheduling Problem with Two Agents and Decreasing Linear Deteriorating Jobs

摘要：

This paper deals with the two-agent scheduling problem with decreasing linear deteriorating jobs on a single machine, where the goal is to minimize the total completion time of the first agent with the restriction that the maximum cost of the second agent cannot exceed a given upper bound. Two agents compete to perform their respective jobs on a common single machine, and each agent has his own criterion to optimize. We introduce a decreasing linear deterioration model into the two-agent single-machine scheduling where the processing times of jobs are defined as a decreasing linear function of their starting times. We propose the optimal properties and present the optimal polynomial time algorithm to solve the scheduling problem.

关键词： Scheduling Two-agent Decreasing linear deterioration Single machine

作者: Peng Liu Na Yi Xiaoye Zhou

作者单位: School of Management, Shenyang University of Technology, Shenyang, 110870, China School of Sciences, Liaoning Shihua University, Fushun, 113001, China School of Management, Shenyang University of Technology, Shenyang, 110870, China.

会议类型: 国际会议

会议名称: 2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)

会议地点: 四川绵阳

会议语种:英文

页码: 279-282

在线出版日期: 2011-05-23（万方平台首次上网日期，不代表论文的发表时间）