Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062)

From MaRDI portal
Revision as of 10:03, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
scientific article

    Statements

    Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    single machine scheduling
    0 references
    weighted shortest remaining processing time
    0 references
    WSRPT rule
    0 references
    efficient heuristic
    0 references