Scheduling for Minimizing Total Penalty Costs Due to Earliness and Tradiness

Abstract

This paper presents total penalty costs of earliness and tradiness as a new performance measure at due-date scheduling. This measure has more practical meaning than the previous lateness measure. An optimal algorithm to minimize this measure is given through Branch-and-Bound method. Three lower bounds are compared from the viewpoint of node numbers and constrained/unconstrained CPU times.