Single machine scheduling to minimize three hierarchically criteria

الملخص EN

I n this paper, to minimize a function of three cost criteria for scheduling n jobs on a single machine , the problem is discussed : {Minimizing a function of three criteria maximum tardiness ,maximum earliness and sum square of completion time in hierarchical method}.

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 Jj (j=1, .

.

.

, n) requires processing during a given positive uninterrupted time pj, without loss of generality, we assume pj to be integral.

For the problem we proposed some algorithms and procedure to find exact and best possible solutions for three criteria maximum tardiness ,maximum earliness and sum square of completion time in hierarchical case.