Development of a heuristic for no-wait flowshop production process to minimise makespan

Azahar Alam and Chandan Bhar

International Journal of Operational Research, 2022, vol. 45, issue 1, 68-85

Abstract: The no-wait flow shop production system has much practical application in manufacturing industries. Minimisation total completion time of the no-wait flow shop comes under the NP-complete category. Consequently, getting effective and efficient quality of results for such types of problems is a challenge where effective means optimal or near-optimal solutions and efficient means, which took less computational time. A heuristic is proposed for the problem under consideration, in which the problem is getting solved in two phases. The first phase is the initial sequence generation, and the second one is the improvement phase. Proposed heuristic is compared with four best-known heuristics, and for the smaller size problem, an exhaustive enumeration is used to check the performance of the heuristic. Moreover, heuristic performance is tested over 600 randomly generated problems of different sizes. For large size problems, it showed that the proposed heuristic is very much efficient.

Keywords: heuristic; no-wait flowshop problem; makespan minimisation; computational complexity. (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=125719 (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:45:y:2022:i:1:p:68-85

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 ().