- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Minimizing Three Hierarchically Criteria on a Single Machine | ||
| Diyala Journal For Pure Science | ||
| Article 1, Volume 13, Issue 1, 2017, Pages 14-22 | ||
| Author | ||
| Adawiya A. Mahmood Al-Nuaimi | ||
| 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. | ||
| Keywords | ||
| Hierarchical multicriteria; Scheduling; single machine; Lexicographical multicriteria | ||
|
Statistics Article View: 77 PDF Download: 19 |
||