- 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 n jobs on a Single machine with multipleobjectives and set-up times | ||
| Journal of College of Education for Pure Science | ||
| Article 1, Volume 1, Issue 3, 2011, Pages 17-31 | ||
| Author | ||
| Waffa Abdul-Abbas | ||
| Abstract | ||
| In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are divided into F families, each family f, (f = 1, …, F) contains nf jobs. Our aim in this study is to find the optimal and near optimal schedule for the n jobs to minimize total weighted completion time and weighted number of tardy jops. For solving this problem we propose a new lower bound (LB) based on relaxation of set-up times and decomposes the problem into tow sub-problems. To be used in a branch and bound algorithm which used to find the optimal solution. We also applied some local search methods to find near optimal solution such as (algorithm AH, Threshold Accepting, Tabu search (TS)). | ||
|
Statistics Article View: 81 PDF Download: 13 |
||