Note: On the two‐machine no‐idle flowshop problem

Ondřej Čepek, Masanori Okada and Milan Vlach

Naval Research Logistics (NRL), 2000, vol. 47, issue 4, 353-358

Abstract: In this short note we study a two‐machine flowshop scheduling problem with the additional no‐idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000

Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(200006)47:43.0.CO;2-U

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:wly:navres:v:47:y:2000:i:4:p:353-358

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().