Note: On the Two-Machine No-Idle Flowshop Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F00%3A00001204" target="_blank" >RIV/00216208:11320/00:00001204 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Note: On the Two-Machine No-Idle Flowshop Problem
Original language description
A flowshop scheduling problem with the additional no-idle constraint and the total completion time criterion function is studied. We show that an earlier paper dealing with this problem contains errors and suggest how these errors can be rectified.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2000
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Naval Research Logistics
ISSN
—
e-ISSN
—
Volume of the periodical
47
Issue of the periodical within the volume
47
Country of publishing house
US - UNITED STATES
Number of pages
6
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—