Parallel machine scheduling under a grade of service provision

DOI10.1016/S0305-0548(03)00164-3zbMATH Open1074.68529MaRDI QIDQ1879792FDOQ1879792

Authors: Soo Y. Chang, Kangbok Lee, Hark-Chin Hwang

Publication date: 23 September 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

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
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

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
The Competitiveness of On-Line Assignments
Bounds on Multiprocessing Timing Anomalies
Approximation algorithms for scheduling unrelated parallel machines
An Application of Bin-Packing to Multiprocessor Scheduling
On the exact upper bound for the Multifit processor scheduling algorithm
Parallel machines scheduling with nonsimultaneous machine available time

Cited In (56)

Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
Mixed coordination mechanisms for scheduling games on hierarchical machines
Makespan minimization in online scheduling with machine eligibility
Online scheduling of two job types on a set of multipurpose machines with unit processing times
Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
Parallel machine scheduling problem with two GoS levels
An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
Fast approximation algorithms for job scheduling with processing set restrictions
Online fractional hierarchical scheduling on uniformly related machines
Online scheduling on two uniform machines to minimize the makespan
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
A two-stage flow shop scheduling problem with transportation considerations
Scheduling jobs with equal processing times subject to machine eligibility constraints
A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
Scheduling parallel machines with inclusive processing set restrictions and job release times
Optimal online algorithms for scheduling on two identical machines under a grade of service
Improved bounds for online scheduling with eligibility constraints
Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
Optimal algorithm for semi-online scheduling on two machines under GoS levels
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
Coordination mechanisms with hybrid local policies
Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
Worst-case analysis for on-line service policies
Scheduling jobs with release and delivery times subject to nested eligibility constraints
Title not available (Why is that?)
On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
Scheduling uniform machines with restricted assignment
Parallel machine scheduling with nested job assignment restrictions
Semi-online hierarchical load balancing problem with bounded processing times
A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
Online and semi-online hierarchical scheduling for load balancing on uniform machines
Parallel machine scheduling with nested processing set restrictions
Online hierarchical scheduling on two uniform machines with bounded job sizes
Scheduling unit length jobs on parallel machines with lookahead information
Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
Semi-online scheduling: a survey
Parallel batch scheduling with nested processing set restrictions
Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
Preemptive scheduling algorithms with nested processing set restriction
Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
Online scheduling on uniform machines with two hierarchies
Makespan minimization in online scheduling with machine eligibility
A note on graph balancing problems with restrictions
Online parallel machines scheduling with two hierarchies
Online and semi-online scheduling of two machines under a grade of service provision
An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies
Online scheduling on parallel machines with two goS levels
Performance of service policies in a specialized service system with parallel servers
Optimal algorithms for semi-online machine covering on two hierarchical machines
Semi-online scheduling problems on two uniform machines under a grade of service provision
Semi-online scheduling with two GoS levels and unit processing time
Scheduling equal length jobs with eligibility restrictions

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)