- 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 Job Families with Setups on A single Machine | ||
| Al-Mustansiriyah Journal of Science | ||
| Article 1, Volume 22, Issue 3, 2011, Pages 51-60 | ||
| Author | ||
| Manal H. Ibrahim | ||
| Abstract | ||
| Many sequencing problems have a combinatorial nature and they are very difficult to optimality within acceptable computation times. We consider the problem of scheduling jobs on a single machine to minimize the multiple objective function, the sum of maximum earliness and maximum tardiness . The jobs partitioned into families, and a set-up time is necessary for scheduling the first job and when there is aswitch in processing jobs from one family to jobs of another family. For solving this problem we derived a lower bound to be used in a branch and bound algorithm. We also proposed heuristic method in order to get an upper bound (near optimal solution). These heuristic method is faster to solve our problem and can find quite good solutions without much computational effort. From our computational experience we found that the branch and bound algorithm solve problems up to 30 jobs with families 2,4,6 satisfactory. | ||
|
Statistics Article View: 64 PDF Download: 38 |
||