Optimal online algorithm for scheduling on two identical machines with machine availability constraints

Authors:
Zhiyi Tan;Yong He
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou 310027, China;Department of Mathematics, Zhejiang University, Hangzhou 310027, China
Venue:
Information Processing Letters
Year:
2002

Citing 7
Cited 6

Amortized efficiency of list update and paging rules

Communications of the ACM
Parallel machines scheduling with nonsimultaneous machine available time

Discrete Applied Mathematics
Better bounds for online scheduling

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines

Discrete Applied Mathematics
Two-machine flowshop scheduling with consecutive availability constraints

Information Processing Letters
A note on “parallel machine scheduling with non-simultaneous machine available time”

Discrete Applied Mathematics
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

Online scheduling to minimize modified total tardiness with an availability constraint

Theoretical Computer Science
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Online scheduling on two uniform machines to minimize the makespan with a periodic availability constraint

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
An optimal semi-online algorithm for 2-machine scheduling with an availability constraint

Journal of Combinatorial Optimization
Scheduling on same-speed processors with at most one downtime on each machine

Discrete Optimization
Minimizing total weighted completion time with an unexpected machine unavailable interval

Journal of Scheduling

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper considers the online scheduling on two identical machines with machine availability constraints for minimizing makespan. We assume that machine Mj is unavailable during period from sj to tj (0 ≤ sj tj), j = 1, 2, and the unavailable periods of two machines do not overlap. We show the competitive ratio of List Scheduling is 3. We further give an optimal algorithm with a competitive ratio 5/2.