Flow Shop Scheduling with Shortening Jobs for Makespan Minimization

被引：1

作者：

Sun, Zheng-Wei ^{[1
]}

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

Wei, Cai-Min ^{[4
]}

Wang, Ji-Bo ^{[1
]}

机构：

[1] Shenyang Aerosp Univ, Sch Comp, Shenyang 110136, Peoples R China

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

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

[4] Shantou Univ, Sch Math & Comp, Shantou 515063, Peoples R China

来源：

MATHEMATICS | 2025年 / 13卷 / 03期

关键词：

scheduling; flow shop; shortening job; makespan; branch-and-bound algorithm; heuristic algorithm; TOTAL COMPLETION-TIME; SOLUTION ALGORITHMS; DETERIORATING JOBS; COMPLEXITY;

D O I：

10.3390/math13030363

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

This paper deals with a two-machine flow shop problem with shortening jobs. A shortening job means that the job's processing time is a decreasing function of its starting time. The aim is to find a sequence that minimizes the makespan of all the jobs. several dominance properties, some lower bounds, and an initial upper bound are derived, which are applied to propose a branch-and-bound algorithm to solve the problem. We also propose some heuristics and mathematical programming. Computational experiments are conducted to evaluate the performance of the proposed algorithms.

引用

页数：23

共 50 条

[1] Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines
Sun, Lin-Hui
Sun, Lin-Yan
Wang, Ming-Zheng
Wang, Ji-Bo
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 138 (01) : 195 - 200
[2] MAKESPAN MINIMIZATION IN REENTRANT FLOW SHOP PROBLEM WITH IDENTICAL JOBS
Romanova, A. A.
Servakh, V. V.
Tavchenko, V. Yu.
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2024, (64):
[3] A makespan minimization API algorithm for flow shop scheduling
Boumediene, Fatima Zohra
Houbad, Yamina
Bessenouci, Hakim Nadhir
Hassam, Ahmed
Ghomri, Latéfa
EEA - Electrotehnica, Electronica, Automatica, 2019, 67 (02): : 123 - 129
[4] MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS
Wang, Ji-Bo
Wang, Ming-Zheng
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2013, 30 (06)
[5] An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling
Dipak Laha
Uday Kumar Chakraborty
The International Journal of Advanced Manufacturing Technology, 2009, 44 : 559 - 569
[6] An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling
Laha, Dipak
Chakraborty, Uday Kumar
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 44 (5-6): : 559 - 569
[7] Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan
Ji-Bo Wang
The International Journal of Advanced Manufacturing Technology, 2010, 48 : 719 - 723
[8] Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan
Wang, Ji-Bo
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 48 (5-8): : 719 - 723
[9] Makespan minimization for the m-machine ordered flow shop scheduling problem
Khatami, Mostafa
Salehipour, Amir
Hwang, F. J.
COMPUTERS & OPERATIONS RESEARCH, 2019, 111 : 400 - 414
[10] Scheduling deteriorating jobs dependent on resources for the makespan minimization
Bachman, A
Janiak, A
OPERATIONS RESEARCH PROCEEDINGS 2000, 2001, : 29 - 34

← 1 2 3 4 5 →