- 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
Approximation methods for total completion time with set-up times | ||
| Journal of Research Diyala humanity | ||
| Article 1, Volume 0, Issue 32, 2017, Pages 296-304 | ||
| Author | ||
| Adawiyah A. Mahmood | ||
| Abstract | ||
| This research considers the problem of scheduling jobs on a single machine to minimize the objective function , the sum of completion time .The jobs partitioned into families , and a set-up time is necessary for scheduling the first job and when there is a switch in processing jobs from one family to jobs of another family . To solve this problem some known approximation methods are modified , namely the tree type heuristic (TTH) and tow local search methods descend method (DM) and simulated annealing method (SAM) . The performance of approximation methods can be tested on a large class of test problems. | ||
| Keywords | ||
| Scheduling; single machine; set; up time; heuristics | ||
|
Statistics Article View: 203 PDF Download: 147 |
||