A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650625 / rank
 
Normal rank
Property / zbMATH Keywords
 
online scheduling
Property / zbMATH Keywords: online scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel machine
Property / zbMATH Keywords: parallel machine / rank
 
Normal rank
Property / zbMATH Keywords
 
competitive ratio
Property / zbMATH Keywords: competitive ratio / rank
 
Normal rank
Property / zbMATH Keywords
 
total weighted completion time
Property / zbMATH Keywords: total weighted completion time / rank
 
Normal rank
Property / zbMATH Keywords
 
instance reduction
Property / zbMATH Keywords: instance reduction / rank
 
Normal rank
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.cor.2013.09.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082271152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-based online scheduling: From single to parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Average Completion Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of parallel machines to minimize total completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / 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
Property / cites work
 
Property / cites work: On-line scheduling to minimize average completion time revisited. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unrelated Machines by Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:45, 12 July 2024

scientific article
Language Label Description Also known as
English
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
scientific article

    Statements

    A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (English)
    0 references
    0 references
    10 November 2016
    0 references
    online scheduling
    0 references
    parallel machine
    0 references
    competitive ratio
    0 references
    total weighted completion time
    0 references
    instance reduction
    0 references

    Identifiers