Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

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

Mohamed HaouariThouraya Daouas — 2010

RAIRO - Operations Research

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.

Page 1

Download Results (CSV)