- 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
Comparison of Approximation Algorithms for Unrelated Parallel Machines to Minimize the Weighted Makespan | ||
| Al-Mustansiriyah Journal of Science | ||
| Article 1, Volume 21, Issue 6, 2010, Pages 383-391 | ||
| Author | ||
| Tariq S.Abdul-Razaq | ||
| Abstract | ||
| The problem of scheduling of unrelated parallel machines is considered. In this environment, a set of n jobs has to be scheduled on m unrelated parallel machines. Each job is available for processing at time zero and each machine can process at most one job at a time and a job can be processed by at most one machine at a time. A case study is considered to schedule jobs in a cutting workshop to minimize the weighted makespan. Five algorithms are proposed and their performance is studied | ||
|
Statistics Article View: 49 PDF Download: 6 |
||