A two-machine no-wait flow shop problem with two competing agents

被引：9

作者：

Azerine, Abdennour ^{[1
]}

Boudhar, Mourad ^{[1
]}

Rebaine, Djamal ^{[2
]}

机构：

[1] Univ Sci & Technol Houari Boumedienne, Fac Math, Lab RECITS, Algiers, Algeria

[2] Univ Quebec Chicoutimi, Dept Informat & Math, Chicoutimi, PQ, Canada

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2022年 / 43卷 / 01期

关键词：

Multi-agent; No-wait in process; Complexity; Flowshop scheduling; Makespan; SCHEDULING PROBLEMS; TRAVELING SALESMAN; MAKESPAN; MINIMIZE; BICRITERIA; FLOWSHOPS; MACHINE;

D O I：

10.1007/s10878-021-00755-9

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：168 / 199

页数：32

共 34 条

[1] FLOWSHOP NO-IDLE OR NO-WAIT SCHEDULING TO MINIMIZE THE SUM OF COMPLETION TIMES [J].