Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (Q2444843): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 00:08, 3 February 2024

scientific article
Language Label Description Also known as
English
Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
scientific article

    Statements

    Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (English)
    0 references
    0 references
    0 references
    11 April 2014
    0 references
    0 references
    scheduling
    0 references
    online algorithms
    0 references
    total completion time
    0 references
    rejection
    0 references