A new heuristic for flow shop scheduling problems minimising system utilisation time subject to minimum makespan

Meenakshi Sharma, Manisha Sharma and Sameer Sharma

International Journal of Operational Research, 2021, vol. 42, issue 2, 190-228

Abstract: This paper presents a heuristic algorithm to solve flow shop scheduling problems (FSSP) with the criterion to minimise the system utilisation time with minimum of maximum completion time (makespan). The proposed algorithm can solve FSSP under both the constraints in all the situations, which to the best of our knowledge has never been studied previously to this extent. To investigate the performance of the proposed heuristic and to compare it with some constructive benchmark heuristics, a number of test problems are solved and the results are reported. Computational results demonstrate that the newly developed heuristic significantly outperforms the other constructive heuristics reported in the literature in terms of solution quality.

Keywords: flow shop scheduling; makespan; delay time; heuristic; utilisation time. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=118984 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijores:v:42:y:2021:i:2:p:190-228

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().