Hidri, L.Haouari, Mohamed2012-08-232012-08-232011-07-010096-3003http://hdl.handle.net/10679/244https://doi.org/10.1016/j.amc.2011.02.108Due to copyright restrictions, the access to the full text of this article is only available via subscription.In this paper, we investigate new lower and upper bounds for the multiple-center hybrid flow shop scheduling problem. We propose a family of center-based lower bounds as well as a destructive lower bound that is based on the concept of revised energetic reasoning. Also, we describe an optimization-based heuristic that requires iteratively solving a sequence of parallel machine problems with heads and tails. We present the results of extensive computational experiments that provide evidence that the proposed bounding procedures consistently improve the best existing ones.engrestrictedAccessarticle217218248826300029062220001010.1016/j.amc.2011.02.108SchedulingHybrid flow shopLower boundsHeuristics2-s2.0-79956080278