Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks

Lotfi Hidri

International Journal of Production Economics, 2016, vol. 182, issue C, 531-534

Abstract: 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.

Keywords: Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks; Lower bounds (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527316302572
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:182:y:2016:i:c:p:531-534

DOI: 10.1016/j.ijpe.2016.10.001

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().