A flexible on-line scheduling algorithm for batch machine with infinite capacity

A flexible on-line scheduling algorithm for batch machine with infinite capacity

0.00 Avg rating0 Votes
Article ID: iaor20052122
Country: Netherlands
Volume: 133
Issue: 1
Start Page Number: 175
End Page Number: 181
Publication Date: Jan 2005
Journal: Annals of Operations Research
Authors: ,
Abstract:

We study on-line scheduling on a batch machine with infinite capacity. We present a flexible on-line scheduling algorithm that aims at minimizing the makespan and achieves the optimal competitive ratio of (1 + √(5))/2.

Reviews

Required fields are marked *. Your email address will not be published.