What question did this study set out to answer?

The aim is to minimize the maximum completion time, or makespan, in a flowshop scheduling problem.

July 5, 2026

On flowshop scheduling with the DeJong's learning effect

KZKai-Fang Zhang JWJi-Bo Wang YLYuan-Yuan LuJilin Normal University

Key Points

The aim is to minimize the maximum completion time, or makespan, in a flowshop scheduling problem.
Analyzed a flowshop problem with m machines and DeJong's learning effect.
Derived properties and various bounds for scheduling approaches.
Proposed a branch-and-bound algorithm along with several heuristic algorithms.
Demonstrated the effectiveness of the proposed algorithms through computational tests.

Abstract

This study deals with a m-machine flowshop problem with the DeJong's learning effect, in which m is the number of machines. The goal is to identify a permutation that minimizes the maximum completion time, i.e., the makespan. We derive several properties, lower bounds, and initial upper bounds, and then propose a branch-and-bound algorithm. Additionally, we develop several heuristic algorithms. Computational tests are presented to evaluate the effectiveness and performance of thees algorithms.

Ask AI

Helpful

Bookmark

View Full Paper