Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 (Q1980488): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-981-16-1877-2_4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3153485508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel machines with inclusive processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and semi-online scheduling of two machines under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online algorithms for scheduling on two identical machines under a grade of service / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online parallel machines scheduling with two hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online algorithms on two hierarchical machines with tightly-grouped processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Reordering for Online Minimum Makespan Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Minimum Makespan Scheduling with a Buffer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online hierarchical scheduling problems with buffer or rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:31, 26 July 2024

scientific article
Language Label Description Also known as
English
Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
scientific article

    Statements

    Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 September 2021
    0 references
    semi-online algorithm
    0 references
    hierarchical machines
    0 references
    competitive ratio
    0 references
    buffer
    0 references

    Identifiers