- 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
A Single Machine Scheduling Problem to Minimize the Sum of Total Completion Times and Total Late Works | ||
| Al-Mustansiriyah Journal of Science | ||
| Article 1, Volume 23, Issue 7, 2012, Pages 117-130 | ||
| Author | ||
| Manal G. Ahmed Al-Ayoubi | ||
| Abstract | ||
| In this paper bi-criteria scheduling problem on a single machine are considered. The two criteria to be minimized are ∑Vi and ∑Ci. We present a Branch and Bound algorithm to find optimal solution for the problem of minimizing a linear function (i.e., ∑Ci + ∑Vi ). A computational experiment for the BAB algorithm on a large set of test problems is given. We use local search heuristics methods to find near optimal solutions that are close to the optimum with less computational time. Also, we report on the results of extensive computations test of the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) Method. The main conclusion to be drawn for our computation results is that (GA) is more effective method for our problem followed by (PSO). Keywords: single machine scheduling, bi-criteria, Genetic algorithm, Particleswarm optimization method | ||
|
Statistics Article View: 158 PDF Download: 88 |
||