Just-in-time scheduling with two competing agents on unrelated parallel machines
详细信息 查看全文
- 作者：Yunqiang Yina ; yinyunqiang@126.com" class="auth_mail" title="E-mail the corresponding author ; Shuenn-Ren Chengb ; T.C.E. Chengc ; Du-Juan Wangd ; wangdujuan@dlut.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Chin-Chia Wue
- 关键词：Scheduling ; Two agents ; Unrelated parallel machines ; Just-in-time scheduling ; FPTAS
- 刊名：Omega
- 出版年：2016
- 出版时间：September 2016
- 年：2016
- 卷：63
- 期：Complete
- 页码：41-47
- 全文大小：323 K
文摘
- •
This paper considers JIT scheduling with two agents on unrelated parallel machines.
- •
Each agent desires to maximize the maximum weight or weighted number of its JIT jobs.
- •
Two problems that seek to find the Pareto-optimal solutions are investigated.
- •
The computational complexity status and efficient solution procedures are provided.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |