A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays

DOI10.1051/ro/2014004zbMath1292.90321OpenAlexW2160610679MaRDI QIDQ5418015

Mehdi Serairi, Aziz Moukrim, Djamal Rebaine

Publication date: 26 May 2014

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2014__48_2_235_0/

zbMATH Keywords

branch and boundtime delaysflowshoplower and upper boundsdominance rule

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

Exact method for the two-machine flow-shop problem with time delays

This page was built for publication: A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays