Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161)

From MaRDI portal
Revision as of 11:13, 30 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7798676
Language Label Description Also known as
English
Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives
scientific article; zbMATH DE number 7798676

    Statements

    Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (English)
    0 references
    0 references
    0 references
    0 references
    2 February 2024
    0 references
    two-agent scheduling
    0 references
    unbounded serial-batch
    0 references
    compatibility/incompatibility
    0 references
    batch/item availability
    0 references
    maximum lateness
    0 references

    Identifiers