A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times

Abstract

This paper considers the permutation flowshop scheduling problem with significant sequence dependent set-up times and develops a savings index heuristic algorithm to find an approximately minimum makespan schedule. The proposed algorithm determines the savings in time associated with a particular sequence and selects the sequence with the maximum time savings as the best heuristic solution. Computational experience indicating the effectiveness and efficiency of the proposed savings index heuristic algorithm are reported and discussed.

Keywords:

• Flowshop Scheduling
• Sequence-Dependent Set-Up Times
• Savings Index

View correction statement:

Erratum: A savings index heuristic algorithm for flowshop scheduling with sequence-dependent setup times

An erratum to this article is available at http://dx.doi.org/10.1057/palgrave.jors.2601873.

An erratum to this article is available at http://dx.doi.org/10.1057/palgrave.jors.2601873.