Asset Details
Do you wish to reserve the book?
Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan
Do you wish to request the book?
Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan
2025
Overview
In this paper we study the online over-time scheduling on an unbounded parallel-batch machine to minimize the weighted makespan. First, we show that the general problem has a low bound 2 and then design a 4-competitive online algorithm. Furthermore, we consider a special case in which the jobs have agreeable processing times and weights. When all jobs have the same weights (the task is to minimize the makespan), an online algorithm with the best possible competitive ratio
5
+
1
2
≈
1.618
has been established in the literature. We show that, after a slightly modification, this known online algorithm also has the best possible competitive ratio
5
+
1
2
≈
1.618
for our problem. Finally, we introduce limited restarts into the above special case and present an online algorithm with a better competitive ratio
11
7
≈
1.571
.
Publisher
Springer US,Springer Nature B.V
Subject
