New Efficient Lower Bound for the Hybrid Flow Shop Scheduling Problem With Multiprocessor Tasks.

Lotfi Hidri Anis Gharbi

Published in: IEEE Access (2017)

Keyphrases

lower bound
upper bound
worst case
computationally expensive
real time
objective function
optimal solution
cost effective
parallel algorithm
branch and bound algorithm
information systems
search algorithm
np hard
branch and bound
robotic systems