Makespan minimization in online scheduling with machine eligibility (Q5894207): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s10288-010-0149-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964937581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Competitiveness of On-Line Assignments / 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: Scheduling on identical machines: How good is LPT in an on-line setting? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling on a small number of hierarchical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit length jobs with parallel nested machine processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / 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: Parallel machine scheduling with nested processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for job scheduling with processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS / 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: 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: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on two uniform machines subject to eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times subject to machine eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on two uniform machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit length jobs on parallel machines with lookahead information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with nested job assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal online algorithm for scheduling two machines with release times / 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: Online and semi-online scheduling of two machines under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Parallel Machines On-Line / 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: Online hierarchical scheduling: an approach using mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis for on-line service policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line service scheduling / 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: Online parallel machines scheduling with two hierarchies / rank
 
Normal rank

Latest revision as of 22:04, 3 July 2024

scientific article; zbMATH DE number 5873360
Language Label Description Also known as
English
Makespan minimization in online scheduling with machine eligibility
scientific article; zbMATH DE number 5873360

    Statements

    Makespan minimization in online scheduling with machine eligibility (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 April 2011
    0 references
    parallel machine scheduling
    0 references
    eligibility constraint
    0 references
    tree-hierarchical and GoS processing sets
    0 references
    interval and nested processing sets
    0 references
    online and semi-online scheduling
    0 references
    offline scheduling
    0 references
    makespan
    0 references
    competitive ratio
    0 references

    Identifiers