Online and semi-online scheduling of two machines under a grade of service provision
From MaRDI portal
Publication:867934
DOI10.1016/J.ORL.2005.11.004zbMATH Open1112.90036OpenAlexW2068191609MaRDI QIDQ867934FDOQ867934
Authors: Soo Y. Chang, Kangbok Lee, Jong Ho Park 
Publication date: 19 February 2007
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.11.004
Recommendations
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- Semi-online scheduling problems on two uniform machines under a grade of service provision
- Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
- Online scheduling on two parallel identical machines under a grade of service provision
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Online and semi-online scheduling on capacitated two-parallel machines
- Two semi-online scheduling problems on two uniform machines
- An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
- Semi on-line scheduling on two identical machines
- Online scheduling on two uniform machines subject to eligibility constraints
Cites Work
- The Competitiveness of On-Line Assignments
- Title not available (Why is that?)
- Semi on-line scheduling on two identical machines
- On-line load balancing in a hierarchical server topology
- Semi on-line algorithms for the partition problem
- Semi-on-line problems on two identical machines with combined partial information
- Parallel machine scheduling under a grade of service provision
- Semi-online scheduling with decreasing job sizes
- On-line algorithms for the channel assignment problem in cellular networks.
Cited In (53)
- Semi-online scheduling on two uniform parallel machines with initial lookahead
- A note on hierarchical scheduling on two uniform machines
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- 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 Scheduling on Parallel Machines with Two GoS Levels
- Online scheduling with unit processing times and processing set restrictions
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- Online fractional hierarchical scheduling on uniformly related machines
- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
- Online scheduling on two uniform machines to minimize the makespan
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
- Optimal online algorithms on two hierarchical machines with resource augmentation
- On-line booking policies and competitive analysis of medical examination in hospital
- Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time
- Online early work maximization on three hierarchical machines with a common due date
- Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
- 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
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- Heuristics for online scheduling on identical parallel machines with two GoS levels
- Improved bounds for online scheduling with eligibility constraints
- Optimal algorithm for semi-online scheduling on two machines under GoS levels
- Online scheduling on two uniform machines subject to eligibility constraints
- Online scheduling on two parallel identical machines under a grade of service provision
- Preemptive scheduling on a small number of hierarchical machines
- The hierarchical model for load balancing on two machines
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
- Bin stretching with migration on two hierarchical machines
- Online hierarchical scheduling: an approach using mathematical programming
- 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
- Total completion time minimization scheduling on two hierarchical uniform machines
- Online hierarchical scheduling on two uniform machines with bounded job sizes
- Scheduling unit length jobs on parallel machines with lookahead information
- Multiprofessor scheduling
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- Semi-online scheduling: a survey
- Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
- Total completion time minimization in online hierarchical scheduling of unit-size jobs
- Online scheduling on uniform machines with two hierarchies
- Makespan minimization in online scheduling with machine eligibility
- Online parallel machines scheduling with two hierarchies
- Online early work maximization problem on two hierarchical machines with buffer or rearrangements
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
- Online scheduling with migration on two hierarchical machines
- Online scheduling on parallel machines with two goS levels
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
- 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
This page was built for publication: Online and semi-online scheduling of two machines 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 Q867934)
