Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207160.2014.922682 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038536406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing in a Hierarchical Server Topology / 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: Bin stretching revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / 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: An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on parallel machines with two goS levels / 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: Semi on-line algorithms for the partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling problems on a small number of machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in online scheduling with machine eligibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for online scheduling with eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines / 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: Semi-on-line problems on two identical machines with combined partial information / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on hierarchical scheduling on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comment on parallel-machine scheduling under a grade of service provision to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision / 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: A note on on-line scheduling with partial information / rank
 
Normal rank

Latest revision as of 01:00, 10 July 2024

scientific article; zbMATH DE number 6431171
Language Label Description Also known as
English
Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
scientific article; zbMATH DE number 6431171

    Statements

    Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 April 2015
    0 references
    scheduling problem
    0 references
    semi-online
    0 references
    hierarchical constraint
    0 references
    competitive ratio
    0 references

    Identifiers