Batch scheduling on uniform machines to minimize total flow‐time

Batch scheduling on uniform machines to minimize total flow‐time

0.00 Avg rating0 Votes
Article ID: iaor20117143
Volume: 39
Issue: 3
Start Page Number: 571
End Page Number: 575
Publication Date: Mar 2012
Journal: Computers and Operations Research
Authors: ,
Keywords: manufacturing industries, combinatorial optimization
Abstract:

The solution of the classical batch scheduling problem with identical jobs and setup times to minimize flowtime is known for twenty five years. In this paper we extend this result to a setting of two uniform machines with machine‐dependent setup times. We introduce an O(n) solution for the relaxed version (allowing non‐integer batch sizes), followed by a simple rounding procedure to obtain integer batch sizes.

Reviews

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