Heuristic Algorithms for a Single-Machine Common Due Date Assignment under Earliness/Tardiness Measure

Abstract

This paper considers a single-machine scheduling problem with a set of various jobs having different weights where the objective is to find the optimal assignment of a common due date and the associated optimal job sequencing to minimize the weighted mean absolute deviation (WMAD) of job completion times about the common due date. In the problem analysis, several dominant solution properties are characterized to organize two efficient heuristic solution algorithms, for which numerical experiments are then made for illustration and comparative review. Their preferences over the reference works are shown in efficiency and effectiveness senses.