Note: On the two‐machine no‐idle flowshop problem |
| |
Authors: | Ondř ej Č epek,Masanori Okada,Milan Vlach |
| |
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 |
| |
Keywords: | flowshop scheduling no‐idle processing |
|
|