Two-agent group scheduling with deteriorating jobs on a single machine
详细信息    查看全文
文摘
This paper considers the two-agent scheduling problems with deteriorating jobs and group technology on a single machine, where the objective 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 deteriorating jobs and group technology into the two-agent single-machine scheduling where the job processing times and group setup times are both functions of their starting times. There are two different linear deterioration functions. We propose the optimal properties and present the optimal polynomial time algorithms for two different scheduling problems, respectively.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700