Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion - MaRDI portal

Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

From MaRDI portal

Publication:2204271

Jump to:navigation, search

DOI10.1504/IJMOR.2017.080743zbMath1452.90175MaRDI QIDQ2204271

Mansour Eddaly, Abdelwaheb Rebaï, Bassem Jarboui, Said Toumi

Publication date: 15 October 2020

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound algorithm makespan lower bound flowshop scheduling permutation flowshops blocking constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Makespan preserving flowshop reengineering via blocking constraints ⋮ Solving constrained flow-shop scheduling problem through multistage fuzzy binding approach with fuzzy due dates

This page was built for publication: Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2204271&oldid=14733266"