Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost

Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost

0.00 Avg rating0 Votes
Article ID: iaor2007159
Country: Netherlands
Volume: 102
Issue: 1
Start Page Number: 143
End Page Number: 148
Publication Date: Jan 2006
Journal: International Journal of Production Economics
Authors: ,
Keywords: programming: dynamic
Abstract:

In this paper we consider an unbounded model of the single machine parallel batch scheduling problem with release dates and three hierarchical criteria. The first criterion is to minimize makespan, the second criterion is to minimize machine occupation time and the third criterion is to minimize stocking cost. We solve this problem by an O(n2) time dynamic programming algorithm.

Reviews

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