A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines

Published:2015-11-13 Issue:1 Volume:19 Page:21-31
ISSN:1094-6136
Container-title:Journal of Scheduling
language:en
Short-container-title:J Sched

Author:

Zhao Kejun,Lu Xiwen,Gu Manzhan

Funder

National Natural Science Foundation of China

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,General Engineering,Software

Link

http://link.springer.com/content/pdf/10.1007/s10951-015-0460-y.pdf

Reference13 articles.

1. Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problem with two competing agents. Operations Research, 52, 229–242.

2. Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Multi-agent single machine scheduling. Annals of Operations Research, 150, 3–15.

3. Agnetis, A., Pascale, G., & Pacciarelli, D. (2009). A Lagrangian approach to single-machine scheduling problems with two competing agents. Journal of Scheduling, 12, 401–415.

4. Agnetis, A., Billaut, J. C., Gawiejnowicz, S., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling—models and algorithms, Springer, Berlin. ISBN 978-3-642-41879-2.

5. Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362, 273–281.

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines;Theoretical Computer Science;2024-10

2. Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization;Journal of Scheduling;2024-07-23

3. LsiA3CS: Deep-Reinforcement-Learning-Based Cloud–Edge Collaborative Task Scheduling in Large-Scale IIoT;IEEE Internet of Things Journal;2024-07-01

4. Exact and Heuristic Methods for Planning and Scheduling Collaborative Manufacturing Systems;IFIP Advances in Information and Communication Technology;2024

5. Two-agent vehicle scheduling problem on a line-shaped network;Journal of Industrial and Management Optimization;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3