On sequencing with earliest starts and due dates with application to computing bounds for the (<i>n/m/G/F</i><sub>max</sub>) problem (Q5671775): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1308664
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Michael Florian / rank
 
Normal rank

Revision as of 23:39, 22 February 2024

scientific article; zbMATH DE number 3405668
Language Label Description Also known as
English
On sequencing with earliest starts and due dates with application to computing bounds for the (<i>n/m/G/F</i><sub>max</sub>) problem
scientific article; zbMATH DE number 3405668

    Statements

    On sequencing with earliest starts and due dates with application to computing bounds for the (<i>n/m/G/F</i><sub>max</sub>) problem (English)
    0 references
    0 references
    0 references
    0 references
    1973
    0 references
    0 references