Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks

In this note the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks is addressed. The objective function to be minimized is the maximum completion time or the makespan. The main purpose of this note is to pinpoint an inaccuracy contained in a recent paper while developing a lower bound (Chou: IJPE, 141:137-145 ) and to propose some valid lower bounds.