Minimizing Total Completion Time on Parallel Machines with Deadline Constraints (Q4429690)

From MaRDI portal
Revision as of 15:49, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article; zbMATH DE number 1986359
Language Label Description Also known as
English
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
scientific article; zbMATH DE number 1986359

    Statements

    Minimizing Total Completion Time on Parallel Machines with Deadline Constraints (English)
    0 references
    0 references
    0 references
    28 September 2003
    0 references
    parallel and identical machines
    0 references
    unrelated machines
    0 references
    total completion time
    0 references
    deadline constraints
    0 references
    preemptive scheduling
    0 references
    maximum lateness
    0 references
    polynomial-time algorithm
    0 references

    Identifiers