Makespan minimization for two parallel machines scheduling with a periodic availability constraint

Authors:
Dehua Xu;Zhenmin Cheng;Yunqiang Yin;Hongxing Li
Affiliations:
School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China;School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China;School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China;School of Electronic and Information Engineering, Dalian University of Technology, Dalian 116024, China
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 4

Two-machine flowshop scheduling with consecutive availability constraints

Information Processing Letters
Heuristics for two-machine no-wait flowshop scheduling with an availability constraint

Information Processing Letters
Single-machine scheduling with periodic maintenance and nonresumable jobs

Computers and Operations Research
Scheduling linear deteriorating jobs with an availability constraint on a single machine

Theoretical Computer Science
An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

Computers and Operations Research
An improved heuristic for two-machine flowshop scheduling with an availability constraint

Operations Research Letters

Some scheduling problems with general position-dependent and time-dependent learning effects

Information Sciences: an International Journal
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
Notes on "some single-machine scheduling problems with general position-dependent and time-dependent learning effects"

Information Sciences: an International Journal
A bi-objective scheduling algorithm for desktop grids with uncertain resource availabilities

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

A two parallel machines scheduling problem where one machine is periodically unavailable with the objective of minimizing makespan is considered. It is showed that the worst-case ratio of the classical LPT algorithm and the competitive ratio of the LS algorithm are 3/2 and 2, respectively, for the offline version and the online version of the problem.