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

Haouari, Mohamed, and Daouas, Thouraya. "Optimal scheduling of the 3-machine assembly-type flow shop." RAIRO - Operations Research 33.4 (2010): 439-445. <http://eudml.org/doc/116598>.

@article{Haouari2010,
abstract = { 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. },
author = {Haouari, Mohamed, Daouas, Thouraya},
journal = {RAIRO - Operations Research},
keywords = {Scheduling; flow shop; branch and bound; assembly-type production. ; scheduling; branch-and-bound; assembly-type production},
language = {eng},
month = {3},
number = {4},
pages = {439-445},
publisher = {EDP Sciences},
title = {Optimal scheduling of the 3-machine assembly-type flow shop},
url = {http://eudml.org/doc/116598},
volume = {33},
year = {2010},
}

TY - JOUR
AU - Haouari, Mohamed
AU - Daouas, Thouraya
TI - Optimal scheduling of the 3-machine assembly-type flow shop
JO - RAIRO - Operations Research
DA - 2010/3//
PB - EDP Sciences
VL - 33
IS - 4
SP - 439
EP - 445
AB - 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.
LA - eng
KW - Scheduling; flow shop; branch and bound; assembly-type production. ; scheduling; branch-and-bound; assembly-type production
UR - http://eudml.org/doc/116598
ER -