We consider a hierarchical multiple criteria scheduling problem on parallel-machines. The jobs are divided into p priority classes and the total flowtime of the class with the Jfc-th highest priority is the fc-th highest objective criterion. We show that the optimal schedule can be constructed by a generalized shortest processing time (SPT) rule.
|Number of pages||3|
|Journal||IIE Transactions (Institute of Industrial Engineers)|
|Publication status||Published - 1 Jan 1994|
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering