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 条

[31] Minimizing the makespan for the flow shop scheduling problem with availability constraints
Aggoune, R
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 153 (03) : 534 - 543
[32] Scheduling Flexible Flow Shop in Labeling Companies to Minimize the Makespan
Wang, Chia-Nan
Hsu, Hsien-Pin
Fu, Hsin-Pin
Nguyen Ky Phuc Phan
Van Thanh Nguyen
COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2022, 40 (01): : 17 - 36
[33] Flow-shop scheduling with exact delays to minimize makespan
Khatami, Mostafa
Salehipour, Amir
Cheng, T. C. E.
COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 183
[34] Improved linear programming relaxations for flow shop problems with makespan minimization
Wallrath, Roderich
Franke, Meik
Walter, Matthias
COMPUTERS & OPERATIONS RESEARCH, 2025, 177
[35] Flow shop-sequencing problem with synchronous transfers and makespan minimization
Soylu, B.
Kirca, Ou
Azizoglu, M.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2007, 45 (15) : 3311 - 3331
[36] Evaluation of high performance constructive heuristics for the flow shop with makespan minimization
Fernando Luis Rossi
Marcelo Seido Nagano
Roberto Fernandes Tavares Neto
The International Journal of Advanced Manufacturing Technology, 2016, 87 : 125 - 136
[37] Evaluation of high performance constructive heuristics for the flow shop with makespan minimization
Rossi, Fernando Luis
Nagano, Marcelo Seido
Tavares Neto, Roberto Fernandes
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2016, 87 (1-4): : 125 - 136
[38] Hybrid flow shop scheduling of new arrival jobs and locked jobs
Wang, Qing
Chen, Ying
Huang, Min
PROCEEDINGS OF THE 33RD CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2021), 2021, : 5169 - 5174
[39] Makespan minimization scheduling with ready times, group technology and shortening job processing times
Wang, Ji-Bo
Liu, Lu
Wang, Jian-Jun
Li, Lin
COMPUTER JOURNAL, 2018, 61 (09): : 1422 - 1428
[40] Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time
Cheng, Mingbao
Tadikamalla, Pandu R.
Shang, Jennifer
Zhang, Bixi
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2015, 66 (05) : 709 - 719

← 1 2 3 4 5 →