A binary-rounding heuristic for multi-period variable-task-duration assignment problems (Q1919790)

From MaRDI portal
Revision as of 07:18, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A binary-rounding heuristic for multi-period variable-task-duration assignment problems
scientific article

    Statements

    A binary-rounding heuristic for multi-period variable-task-duration assignment problems (English)
    0 references
    0 references
    0 references
    19 January 1997
    0 references
    multi-period assignment
    0 references
    multiple time periods
    0 references
    three-dimensional assignment
    0 references

    Identifiers