- 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
Local search methods for a single machine scheduling problem | ||
| Journal of Research Diyala humanity | ||
| Article 1, Volume 0, Issue 36, 2017, Pages 242-248 | ||
| Authors | ||
| Khalid H. AL- Jourany; Adawiyah A. Mahmood | ||
| Abstract | ||
| The problem of scheduling jobs on a single machine to minimize the weighted sum of squares completion time is considered .Al-Salihi used a branch and bound method to minimize the weighted sum of squares completion time. In this research we discuss and apply some known local search methods , namely the adjacent pairwise interchange method (APIM) and descent method (DM) . The performance of local search methods can be tested on large class of test problems. | ||
| Keywords | ||
| Heuristics; local search; Optimization | ||
|
Statistics Article View: 43 PDF Download: 3 |
||