EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Flow Shop Scheduling with Shortening Jobs for Makespan Minimization

Zheng-Wei Sun, Dan-Yang Lv, Cai-Min Wei, Ji-Bo Wang

Mathematics · 23.01.2025 · 13 (3) · 363

DOI: 10.3390/math13030363 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 23.01.2025. Verfasst von Zheng-Wei Sun und 3 weiteren Autor:innen. Die Arbeit wurde bisher 14-mal zitiert (Crossref) und nennt 46 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: fundamental research funds for the universities of liaoning province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • fundamental research funds for the universities of liaoning province

Zitieren

APA

Sun, Z., Lv, D., Wei, C., & Wang, J. (2025). Flow Shop Scheduling with Shortening Jobs for Makespan Minimization. Mathematics, 13(3), 363. https://doi.org/10.3390/math13030363

Vancouver

Sun Z, Lv D, Wei C, Wang J. Flow Shop Scheduling with Shortening Jobs for Makespan Minimization. Mathematics. 2025;13(3):363. doi:10.3390/math13030363

BibTeX
@article{Sun2025,
  author = {Sun, Zheng-Wei and Lv, Dan-Yang and Wei, Cai-Min and Wang, Ji-Bo},
  title = {Flow Shop Scheduling with Shortening Jobs for Makespan Minimization},
  journal = {Mathematics},
  year = {2025},
  volume = {13},
  number = {3},
  pages = {363},
  doi = {10.3390/math13030363}
}
Kostenlos starten →