Unrelated parallel machine scheduling with new criteria: Complexity and models
Journal article, Peer reviewed
MetadataShow full item record
Original versionComputers & Operations Research. 2021, 132 . 10.1016/j.cor.2021.105291
In this paper, a scheduling problem on non-identical parallel machines with auxiliary resources and sequence-dependent and machine-dependent setup times is studied. This problem can be found in various manufacturing contexts, and in particular in workshops of wafer manufacturing facilities. Three different criteria are defined and analyzed: The number of products completed before the end of a given time horizon, the weighted sum of completion times and the number of auxiliary resource moves. The first criterion is maximized, while the two others are minimized. The first and the third criteria are not classical in scheduling theory, but are justified in industrial settings. The complexity of the problem with each of the new criteria is characterized. Integer linear programming models are also proposed and numerical experiments are conducted to analyze their behavior.