Minimizing Conditional Mean Tardiness and Mean Earliness on a Single Machine with the due Windows Approach

Abstract

A Multicriteria scheduling problem that involves four due date-based performance measures; the total tardiness, proportion of tardy jobs, total earliness as well as the proportion of early jobs was reduced to an equivalent bicriteria problem of minimizing conditional mean Tardiness and conditional mean earliness. A schedule that optimizes these measures tend towards an ideal Just-In-Time (JIT) schedule. Two solution methods named GOA 1 and GOA 2 were proposed to solve the equivalent reduced problem. A single machine and due window approach was explored. The ideal JIT schedule with zero tardiness and zero earliness was set as the optimal and used for benchmarking the proposed solution as well as other methods found in the literature. The results show that the proposed heuristics yielded results that are not significantly different from the optimal in some instances.