期刊
JOURNAL OF COMBINATORIAL OPTIMIZATION
卷 43, 期 1, 页码 168-199出版社
SPRINGER
DOI: 10.1007/s10878-021-00755-9
关键词
Multi-agent; No-wait in process; Complexity; Flowshop scheduling; Makespan
This paper investigates the two-machine no-wait flow shop scheduling problem with two competing agents, proposing exact and approximation algorithms, mathematical programming model, and conducting experiments to demonstrate their effectiveness.
In this paper, we study the two-machine no-wait flow shop scheduling problem with two competing agents. The objective is to minimize the overall completion time of one agent subject to an upper bound on the makespan of the second agent. We proved the NP-hardness for three special cases: (1) each agent has exactly two operations. (2) the jobs of one agent require processing only on one machine, (3) the no-wait constraint is only required for the jobs of one agent. We exhibited polynomial time algorithms for other restricted cases. We also proposed a mathematical programming model and a branch and bound scheme as solving approaches for small-scale problems. For large instances, we present a tabu search meta-heuristic algorithm. An intensive experimental study is conducted to illustrate the effectiveness of the proposed exact and approximation algorithms.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据