Minimizing Three Hierarchically Criteria on a Single Machine

Abstract

The problem of minimizing a function of three criteria maximum lateness, maximum earliness and sum of completion time in hierarchical method is discussed in this paper. A set of n independent jobs has to be scheduled on a single machine that is continuously available from time zero onwards and that can handle no more than one job at a time. Job j (j=1,2,…,n) requires processing during a given positive uninterrupted time pj. Some algorithms to find exact and best possible solutions are proposed for the problem of three criteria maximum lateness, maximum earliness and sum of completion time in hierarchical case.