On the complexity of proportionate open shop and job shop problems

被引：0

作者：

Azerine, Abdennour ^{[1
,2
]}

Boudhar, Mourad ^{[1
]}

Rebaine, Djamal ^{[3
]}

机构：

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

[2] CERIST, Res Ctr Sci & Tech Informat, Algiers, Algeria

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

来源：

OPTIMIZATION LETTERS | 2024年 / 18卷 / 01期

关键词：

Proportionate shop; Complexity; Scheduling; Makespan; Maximum lateness; Mean finish time; Just-in-time;

D O I：

10.1007/s11590-023-02000-0

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we present NP-hardness proofs and exhibit linear-time algorithms for proportionate two-machine open shop and job shop problems with respect to the maximum lateness, the makespan with release dates, the total weighted completion times and the number of just-in-time jobs.

引用

页码：365 / 375

页数：11