Weighted earliness / tardiness parallel machine scheduling problem with a common due date

Oğuzhan Ahmet ARIK

This paper investigates an unrelated parallel machine scheduling problem with a restrictive common due date. The objective is to minimize the total sum of earliness/tardiness costs. Using some properties of the problem such as V-Shaped property, optimizing start times of machines, and no idle time between successive jobs, we propose effective construction-based heuristics and local search algorithms for the problem. Using variants of the shortest and longest processing time dispatching rules and job assignment patterns, we propose four different con- struction algorithms to have a balanced num ...Daha fazlası