Online and semi-online scheduling of two machines under a grade of service provision

DOI10.1016/j.orl.2005.11.004zbMath1112.90036OpenAlexW2068191609MaRDI QIDQ867934

Kangbok Lee, Soo Y. Chang, 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

zbMATH Keywords

onlinegrade of servicesemi-onlinetwo machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (48)

Total completion time minimization in online hierarchical scheduling of unit-size jobs ⋮ Online parallel machines scheduling with two hierarchies ⋮ Online scheduling on two uniform machines subject to eligibility constraints ⋮ OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION ⋮ Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes ⋮ Semi-online early work maximization problem on two hierarchical machines with partial information of processing time ⋮ On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines ⋮ A note on hierarchical scheduling on two uniform machines ⋮ Total completion time minimization scheduling on two hierarchical uniform machines ⋮ An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times ⋮ 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 ⋮ Multiprofessor scheduling ⋮ Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time ⋮ Online hierarchical scheduling: an approach using mathematical programming ⋮ Bin stretching with migration on two hierarchical machines ⋮ Online scheduling on two parallel identical machines under a grade of service provision ⋮ 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 ⋮ Online early work maximization on three hierarchical machines with a common due date ⋮ Online early work maximization problem on two hierarchical machines with buffer or rearrangements ⋮ Online and semi-online hierarchical scheduling for load balancing on uniform machines ⋮ Optimal algorithms for semi-online machine covering on two hierarchical machines ⋮ Preemptive scheduling on a small number of hierarchical machines ⋮ The hierarchical model for load balancing on two machines ⋮ Scheduling unit length jobs on parallel machines with lookahead information ⋮ Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing ⋮ 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 ⋮ 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 ⋮ Improved bounds for online scheduling with eligibility constraints ⋮ On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints ⋮ Optimal algorithm for semi-online scheduling on two machines under GoS levels ⋮ Online scheduling on two uniform machines to minimize the makespan ⋮ Heuristics for online scheduling on identical parallel machines with two GoS levels ⋮ Online scheduling with unit processing times and processing set restrictions ⋮ 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 ⋮ Online scheduling with migration on two hierarchical machines ⋮ On-line booking policies and competitive analysis of medical examination in hospital ⋮ Optimal online algorithms on two hierarchical machines with tightly-grouped processing times

Cites Work

• Unnamed Item
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• On-line algorithms for the channel assignment problem in cellular networks.
• Semi-on-line problems on two identical machines with combined partial information
• Parallel machine scheduling under a grade of service provision
• On-Line Load Balancing in a Hierarchical Server Topology
• The Competitiveness of On-Line Assignments
• Semi-online scheduling with decreasing job sizes

This page was built for publication: Online and semi-online scheduling of two machines under a grade of service provision