Minimizing total weighted completion time approximately for the parallel machine problem with a single server (Q2448861): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q57633789, #quickstatements; #temporary_batch_1722424008430
 
(3 intermediate revisions by 3 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.1016/j.ipl.2014.04.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024331184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for parallel machine problems with a single server / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with a common server / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for minimizing mean flow time with unit setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Server, Two-Machine Sequencing with Switching Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for parallel machine scheduling with a common server / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with multiple servers / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57633789 / rank
 
Normal rank

Latest revision as of 13:13, 31 July 2024

scientific article
Language Label Description Also known as
English
Minimizing total weighted completion time approximately for the parallel machine problem with a single server
scientific article

    Statements

    Minimizing total weighted completion time approximately for the parallel machine problem with a single server (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2014
    0 references
    parallel machine scheduling
    0 references
    single server
    0 references
    approximation algorithm
    0 references
    worst-case analysis
    0 references

    Identifiers