IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i3p363-d1574570.html
   My bibliography  Save this article

Flow Shop Scheduling with Shortening Jobs for Makespan Minimization

Author

Listed:
  • Zheng-Wei Sun

    (School of Computer, Shenyang Aerospace University, Shenyang 110136, China
    These authors contributed equally to this work.)

  • Dan-Yang Lv

    (School of Mechatronics Engineering, Shenyang Aerospace University, Shenyang 110136, China
    Key Laboratory of Rapid Development & Manufacturing Technology for Aircraft, Shenyang Aerospace University, Ministry of Education, Shenyang 110136, China
    These authors contributed equally to this work.)

  • Cai-Min Wei

    (School of Mathematics and Computer, Shantou University, Shantou 515063, China
    These authors contributed equally to this work.)

  • Ji-Bo Wang

    (School of Computer, Shenyang Aerospace University, Shenyang 110136, China
    These authors contributed equally to this work.)

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.

Suggested Citation

  • Zheng-Wei Sun & Dan-Yang Lv & Cai-Min Wei & Ji-Bo Wang, 2025. "Flow Shop Scheduling with Shortening Jobs for Makespan Minimization," Mathematics, MDPI, vol. 13(3), pages 1-23, January.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:3:p:363-:d:1574570
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/3/363/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/3/363/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:3:p:363-:d:1574570. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.