Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On-Line Load Balancing in a Hierarchical Server Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Techniques for Average Completion Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grouping techniques for scheduling problems: simpler and faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with job assignment restrictions / 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: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / 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: Improved Approximation Schemes for Scheduling Unrelated Parallel Machines / 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: Task Scheduling on a Multiprocessor System with Independent Memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / 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: Efficient approximation schemes for scheduling problems with release dates and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS / 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: Scheduling Unrelated Machines by Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank
 
Normal rank

Latest revision as of 07:28, 2 July 2024

scientific article
Language Label Description Also known as
English
Scheduling parallel machines with inclusive processing set restrictions and job release times
scientific article

    Statements

    Scheduling parallel machines with inclusive processing set restrictions and job release times (English)
    0 references
    0 references
    0 references
    10 December 2009
    0 references
    0 references
    scheduling
    0 references
    parallel machines
    0 references
    release times
    0 references
    worst-case analysis
    0 references
    polynomial time approximation scheme
    0 references
    0 references
    0 references
    0 references