A note on hierarchical minimization of flowtimes on parallel-machines

Edwin Tai Chiu Cheng, J. E. Diamond

Research output: Journal article publicationJournal articleAcademic researchpeer-review

1 Citation (Scopus)


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.
Original languageEnglish
Pages (from-to)109-111
Number of pages3
JournalIIE Transactions (Institute of Industrial Engineers)
Issue number2
Publication statusPublished - 1 Jan 1994

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this