Hostname: page-component-cd4964975-598jt Total loading time: 0 Render date: 2023-03-30T17:26:03.630Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

Optimal scheduling of the 3-machine assembly-type flow shop

Published online by Cambridge University Press:  15 August 2002

Mohamed Haouari
Ecole Polytechnique de Tunisie, BP. 743, 2078 La Marsa, Tunisia.
Thouraya Daouas
Institut des Hautes Etudes Commerciales, 2016 Carthage-Presidence, Tunisia.
Get access


We address the 3-Machine Assembly-Type Flowshop Scheduling Problem (3MAF). This problem is known to be NP-complete in the strong sense. We propose an exact branch and bound method based on a recursive enumeration of potential inputs and outputs of the machines. Using this algorithm, several large size instances have been solved to optimality.

Research Article
© EDP Sciences, 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)