Solving a multicriteria problem in a hierarchical method

The problem of minimizing a function of three criteria maximum earliness, the sum of completion times and maximum lateness in a hierarchical method is presented 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. An algorithm to find the best possible solution is proposed for the problem of three criteria maximum earliness, the sum of completion times and maximum lateness in a hierarchical case.