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

Authors:
Jongho Park;Soo Y. Chang;Kangbok Lee
Affiliations:
Department of Industrial and Management Engineering, Division of Electrical and Computer Engineering, Pohang University of Science and Technology, San 31 Hyoja-Dong, Pohang, Kyungbook 790-784, Rep ...;Department of Industrial and Management Engineering, Division of Electrical and Computer Engineering, Pohang University of Science and Technology, San 31 Hyoja-Dong, Pohang, Kyungbook 790-784, Rep ...;Department of Industrial and Management Engineering, Division of Electrical and Computer Engineering, Pohang University of Science and Technology, San 31 Hyoja-Dong, Pohang, Kyungbook 790-784, Rep ...
Venue:
Operations Research Letters
Year:
2006

Citing 7
Cited 17

The competitiveness of on-line assignments

Journal of Algorithms
Semi on-line scheduling on two identical machines

Computing
On-Line Load Balancing in a Hierarchical Server Topology

SIAM Journal on Computing
On-line algorithms for the channel assignment problem in cellular networks

Discrete Applied Mathematics
Semi on-line algorithms for the partition problem

Operations Research Letters
Semi-online scheduling with decreasing job sizes

Operations Research Letters
Semi-on-line problems on two identical machines with combined partial information

Operations Research Letters

Preemptive scheduling on a small number of hierarchical machines

Information and Computation
An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan

Information Processing Letters
Online scheduling on two uniform machines to minimize the makespan

Theoretical Computer Science
A Mathematical Programming Approach for Online Hierarchical Scheduling

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Online parallel machines scheduling with two hierarchies

Theoretical Computer Science
Online scheduling on two uniform machines subject to eligibility constraints

Theoretical Computer Science
Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Online hierarchical scheduling: An approach using mathematical programming

Theoretical Computer Science
Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times

Journal of Combinatorial Optimization
Online and semi-online hierarchical scheduling for load balancing on uniform machines

Theoretical Computer Science
Online scheduling of two job types on a set of multipurpose machines with unit processing times

Computers and Operations Research
Scheduling unit length jobs on parallel machines with lookahead information

Journal of Scheduling
Optimal online algorithms on two hierarchical machines with resource augmentation

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Online scheduling on uniform machines with two hierarchies

Journal of Combinatorial Optimization
Semi-online hierarchical scheduling problems with buffer or rearrangements

Information Processing Letters
On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines

Journal of Combinatorial Optimization
Semi-online scheduling with two GoS levels and unit processing time

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the online scheduling of two machines under a grade of service (GoS) provision and its semi-online variant where the total processing time is known. Respectively for the online and semi-online problems, we develop algorithms with competitive ratios of 53 and 32 which are shown to be optimal.