Parallel machine scheduling under a grade of service provision
From MaRDI portal
Publication:1879792
DOI10.1016/S0305-0548(03)00164-3zbMath1074.68529MaRDI QIDQ1879792
Kangbok Lee, Soo Y. Chang, Hark-Chin Hwang
Publication date: 23 September 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions ⋮ Online parallel machines scheduling with two hierarchies ⋮ Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes ⋮ Online and semi-online scheduling of two machines under a grade of service provision ⋮ Parallel machine scheduling with nested processing set restrictions ⋮ Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints ⋮ Parallel batch scheduling with nested processing set restrictions ⋮ Semi-online scheduling: a survey ⋮ Semi-online scheduling problems on two uniform machines under a grade of service provision ⋮ Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements ⋮ Semi-online scheduling with two GoS levels and unit processing time ⋮ Online scheduling on uniform machines with two hierarchies ⋮ Mixed coordination mechanisms for scheduling games on hierarchical machines ⋮ Coordination mechanisms with hybrid local policies ⋮ Fast approximation algorithms for job scheduling with processing set restrictions ⋮ Semi-online hierarchical load balancing problem with bounded processing times ⋮ Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Scheduling uniform machines with restricted assignment ⋮ Online and semi-online hierarchical scheduling for load balancing on uniform machines ⋮ A two-stage flow shop scheduling problem with transportation considerations ⋮ Scheduling jobs with equal processing times subject to machine eligibility constraints ⋮ Optimal algorithms for semi-online machine covering on two hierarchical machines ⋮ Scheduling unit length jobs on parallel machines with lookahead information ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Online scheduling on parallel machines with two goS levels ⋮ Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 ⋮ TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Online scheduling of two job types on a set of multipurpose machines with unit processing times ⋮ An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan ⋮ A comment on parallel-machine scheduling under a grade of service provision to minimize makespan ⋮ An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies ⋮ Worst-case analysis for on-line service policies ⋮ Parallel machine scheduling with nested job assignment restrictions ⋮ Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints ⋮ Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration ⋮ A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs ⋮ Improved bounds for online scheduling with eligibility constraints ⋮ A note on graph balancing problems with restrictions ⋮ On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints ⋮ Optimal online algorithms for scheduling on two identical machines under a grade of service ⋮ Scheduling jobs with release and delivery times subject to nested eligibility constraints ⋮ Optimal algorithm for semi-online scheduling on two machines under GoS levels ⋮ Scheduling equal length jobs with eligibility restrictions ⋮ Online scheduling on two uniform machines to minimize the makespan ⋮ POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION ⋮ PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION ⋮ Scheduling parallel machines with inclusive processing set restrictions and job release times ⋮ Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs ⋮ Online fractional hierarchical scheduling on uniformly related machines
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Parallel machines scheduling with nonsimultaneous machine available time
- On the exact upper bound for the Multifit processor scheduling algorithm
- An Application of Bin-Packing to Multiprocessor Scheduling
- The Competitiveness of On-Line Assignments
- Bounds on Multiprocessing Timing Anomalies
