- 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
Scheduling jobs with release dates on identical machines to minimize weighted completion times function | ||
| journal of kerbala university | ||
| Article 1, Volume 8, Issue 1, 2012, Pages 122-133 PDF (0 K) | ||
| Author | ||
| Hanan Ali Chachan | ||
| Abstract | ||
| This paper considers the problem of scheduling independent jobs with release dates on m identical machines to find minimize the total weighted completion times. The purpose of this paper is to describe meta-heuristic algorithms such as Memetic algorithm approach (MA),Threshold acceptance algorithm (TA) and Tabu search (TS), in order to find near optimal solution (feasible solution) to minimize the total weighted completion time which subject to release dates. The problem denoted as . | ||
|
Statistics Article View: 135 PDF Download: 126 |
||