Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan

Authors:
Ruyan Fu;Ji Tian;Jinjiang Yuan;Ya Li
Affiliations:
College of Sciences, China University of Mining and Technology, Xuzhou, Jiangsu 221116, Peoples Republic of China;College of Sciences, China University of Mining and Technology, Xuzhou, Jiangsu 221116, Peoples Republic of China;School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, Peoples Republic of China;School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, Peoples Republic of China
Venue:
Information Processing Letters
Year:
2014

Citing 6
Cited 0

Batching and scheduling jobs on batch and discrete processors

Operations Research
An optimal online algorithm for scheduling two machines with release times

Theoretical Computer Science
Minimizing Makespan in Batch Machine Scheduling

Algorithmica
Online scheduling on unbounded parallel-batch machines to minimize the makespan

Information Processing Letters
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

Journal of Scheduling
Scheduling on identical machines: How good is LPT in an on-line setting?

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan. In the problem, the jobs arrive online over time and to be processed on two machines M"1 and M"2. M"1 is an unbounded parallel-batch machine and M"2 is a standard machine. The objective is to minimize the makespan, i.e., the maximum completion time of all jobs. For this problem, we present an online algorithm of competitive ratio 5+54~1.809.