- 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 on a Single Machine | ||
| Baghdad Science Journal | ||
| Article 1, Volume 7, Issue 4, 2010, Pages 1455-1457 | ||
| Authors | ||
| Naji M. Saheab; Adawiyah A. Mahmood | ||
| Abstract | ||
| The problem of scheduling n jobs on a single machine is considered, where the jobs are partitioned into several families and a set – up time is necessary between jobs of different families. The objective is to find a lower bound for the problem of minimizing the sum of completion times and the maximum tardiness. This paper uses a decomposition property to find a lower bound in order to incorporated in a branch and bound algorithm for constructing an optimal schedule. | ||
| Keywords | ||
| Scheduling; Set; up time; Multiple Objective | ||
|
Statistics Article View: 46 PDF Download: 21 |
||