Flow Shop Scheduling with Shortening Jobs for Makespan Minimization

Zheng-Wei Sun, Dan-Yang Lv, Cai-Min Wei () and Ji-Bo Wang ()
Additional contact information
Zheng-Wei Sun: School of Computer, Shenyang Aerospace University, Shenyang 110136, China
Dan-Yang Lv: School of Mechatronics Engineering, Shenyang Aerospace University, Shenyang 110136, China
Cai-Min Wei: School of Mathematics and Computer, Shantou University, Shantou 515063, China
Ji-Bo Wang: School of Computer, Shenyang Aerospace University, Shenyang 110136, China

Mathematics, 2025, vol. 13, issue 3, 1-23

Abstract: 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.

Keywords: scheduling; flow shop; shortening job; makespan; branch-and-bound algorithm; heuristic algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/3/363/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/3/363/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:3:p:363-:d:1574570

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().