On the hybrid flowshop scheduling problem

The hybrid flowshop scheduling problem requires minimizing the makespan in a serial multiple-stage manufacturing system, where each stage consists of parallel identical machines. The purpose of this note is to pinpoint several inaccuracies contained in a recent paper and to propose a valid lower bound. (C) 2007 Elsevier B.V. All rights reserved.