期刊
ENGINEERING OPTIMIZATION
卷 51, 期 2, 页码 217-230出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/0305215X.2018.1458844
关键词
Multi-agent scheduling; just-in-time jobs; no-wait flow shop; approximate pareto-optimal frontier
资金
- National Natural Science Foundation of China [11401605, 11501279, 11701595]
- Young Backbone Teachers of Henan Colleges [2015GGJS-193]
This article studies a multi-agent scheduling problem on a set of m machines in a no-wait flow shop system, where each agent's objective function is to maximize its own weighted number of just-in-time jobs. Two variants of the problem are investigated. One is the constrained optimization problem and the other is the Pareto optimization problem. When the number of agents is arbitrary, both problems are proved to be strongly NP-hard. When the number of agents is fixed, pseudo-polynomial time algorithms are first designed to solve them, respectively, then an (1,1- epsilon, ... , 1 - epsilon)-approximation algorithm is provided for the former problem, and an (1 - epsilon)-approximate Pareto-optimal frontier is constructed for the latter problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据