Parallel machine scheduling under a grade of service provision
From MaRDI portal
Recommendations
- Two approximation schemes for scheduling on parallel machines under a grade of service provision
- A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
- scientific article; zbMATH DE number 5525401
- Parallel machine scheduling with service hierarchy and rejection
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- Parallel machine scheduling with machine availability and eligibility constraints
- Optimal parallel machines scheduling with availability constraints
- scientific article; zbMATH DE number 1305540
- Online scheduling on two parallel identical machines under a grade of service provision
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An Application of Bin-Packing to Multiprocessor Scheduling
- Approximation algorithms for scheduling unrelated parallel machines
- Bounds on Multiprocessing Timing Anomalies
- On the exact upper bound for the Multifit processor scheduling algorithm
- Parallel machines scheduling with nonsimultaneous machine available time
- The Competitiveness of On-Line Assignments
Cited in
(56)- Online and semi-online scheduling of two machines under a grade of service provision
- scientific article; zbMATH DE number 5525401 (Why is no real title available?)
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
- Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
- Online and semi-online hierarchical scheduling for load balancing on uniform machines
- Preemptive scheduling algorithms with nested processing set restriction
- Parallel machine scheduling with nested processing set restrictions
- Scheduling unit length jobs on parallel machines with lookahead information
- Scheduling uniform machines with restricted assignment
- Makespan minimization in online scheduling with machine eligibility
- Online hierarchical scheduling on two uniform machines with bounded job sizes
- A note on graph balancing problems with restrictions
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- Mixed coordination mechanisms for scheduling games on hierarchical machines
- Online scheduling on two uniform machines to minimize the makespan
- A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
- Parallel batch scheduling with nested processing set restrictions
- 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
- Optimal algorithm for semi-online scheduling on two machines under GoS levels
- Parallel machine scheduling with nested job assignment restrictions
- Fast approximation algorithms for job scheduling with processing set restrictions
- A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
- Two approximation schemes for scheduling on parallel machines under a grade of service provision
- A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
- Performance of service policies in a specialized service system with parallel servers
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies
- Semi-online hierarchical load balancing problem with bounded processing times
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- A two-stage flow shop scheduling problem with transportation considerations
- Online scheduling on parallel machines with two goS levels
- Semi-online scheduling problems on two uniform machines under a grade of service provision
- Makespan minimization in online scheduling with machine eligibility
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
- Improved bounds for online scheduling with eligibility constraints
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- Optimal algorithms for semi-online machine covering on two hierarchical machines
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- Parallel machine scheduling problem with two GoS levels
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Coordination mechanisms with hybrid local policies
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Online parallel machines scheduling with two hierarchies
- Semi-online scheduling with two GoS levels and unit processing time
- Online fractional hierarchical scheduling on uniformly related machines
- Semi-online scheduling: a survey
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
- Online scheduling on uniform machines with two hierarchies
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
- A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
- Scheduling equal length jobs with eligibility restrictions
- Worst-case analysis for on-line service policies
This page was built for publication: Parallel machine scheduling under a grade of service provision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879792)
