- 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 a Quadratic Completion Time | ||
| Al-Mustansiriyah Journal of Science | ||
| Article 1, Volume 17, Issue 4, 2006, Pages 94-103 | ||
| Author | ||
| KAWA AZAD ABDULLAH | ||
| Abstract | ||
| In this paper, we study the weighted sum of square completion time's problem with set-up times on a single machine. The same problem with no set-up times was first solved by Townsend [1], and was solved by other references like [2], [3] and [4]. We generalize the problem described by the above references, and solve it with set-up times, in other word with families. A set-up time is required between two distinct families, and is required before the job that is scheduled first. We solve the problem by a branch and bound algorithm, a new improved lower bound and a new heuristic method have been used in the branching tree. The paper also considers some new results which can be used to reduce the size of the branching tree, and thus curtailing the enumeration efforts at the branching stage | ||
|
Statistics Article View: 41 PDF Download: 38 |
||