Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (Q290334): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s40305-015-0093-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1216488046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive multiprocessor scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with machine cost and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank

Latest revision as of 02:58, 12 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines
scientific article

    Statements

    Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (English)
    0 references
    0 references
    0 references
    1 June 2016
    0 references
    0 references
    scheduling
    0 references
    online algorithms
    0 references
    total weighted completion time
    0 references
    rejection
    0 references
    0 references