Sign in
Back
Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks
Journal article   Peer reviewed

Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks

Lotfi Hidri
International journal of production economics, Vol.182, pp.531-534
01/12/2016
DOI: https://doi.org/10.1016/j.ijpe.2016.10.001

Abstract

Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks Lower bounds
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.

Metrics

1 Record Views

Details