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 条
12345