Research on two-machine flow shop scheduling problem with release dates and truncated learning effects

被引：19

作者：

Lv, Dan-Yang ^{[1
,2
]}

Wang, Ji-Bo ^{[1
,2
]}

机构：

[1] Shenyang Aerosp Univ, Sch Mechatron Engn, Shenyang, Peoples R China

[2] Shenyang Aerosp Univ, Minist Educ, Lab Rapid Dev & Mfg Technol Aircraft, Shenyang, Peoples R China

来源：

ENGINEERING OPTIMIZATION | 2025年 / 57卷 / 07期

关键词：

Scheduling; release date; truncated learning effect; flow shop; dominance condition; SINGLE-MACHINE; MINIMIZE;

D O I：

10.1080/0305215X.2024.2372633

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In this article, a two-machine flow shop scheduling problem with release dates and truncated learning effects is studied. The objective is to find a sequence such that the total completion time is minimized. This problem is NP-hard and cannot be solved in polynomial time. Therefore, a branch-and-bound algorithm (dominance conditions, lower bounds and an upper bound are needed) and an heuristic algorithm are proposed. In addition, simulated annealing and tabu search are developed to obtain near-optimal solutions for the problem. A large number of computational tests have been conducted, and the data show that the branch-and-bound algorithm can handle small-sized problems effectively within 14 jobs, while the proposed heuristic algorithm has a shorter running time for large-sized problems.

引用

页码：1828 / 1848

页数：21