Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Xian-Yu Yu / rank
Normal rank
 
Property / author
 
Property / author: Yu-Lin Zhang / rank
Normal rank
 
Property / author
 
Property / author: Xian-Yu Yu / rank
 
Normal rank
Property / author
 
Property / author: Yu-Lin Zhang / 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.1007/s10951-013-0350-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019692413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with consecutive availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for two-machine flowshop scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling deteriorating jobs subject to job or machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with periodic maintenance to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 71/60 theorem for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter bounds of the First Fit algorithm for the bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm / rank
 
Normal rank

Latest revision as of 21:36, 8 July 2024

scientific article
Language Label Description Also known as
English
Single-machine scheduling with periodic maintenance to minimize makespan revisited
scientific article

    Statements

    Single-machine scheduling with periodic maintenance to minimize makespan revisited (English)
    0 references
    0 references
    0 references
    0 references
    18 August 2014
    0 references
    scheduling
    0 references
    maintenance
    0 references
    worst-case analysis
    0 references
    performance bound
    0 references

    Identifiers