- 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
Developing Multistage Heuristic Algorithm To Minimize Idle Time And Makespan In Job Shop Scheduling | ||
| Engineering and Technology Journal | ||
| Article 1, Volume 28, Issue 14, 2010, Pages 4789-4805 PDF (213.01 K) | ||
| DOI: 10.30684/etj.28.14.8 | ||
| Author | ||
| Mahmoud Abbas Mahmoud | ||
| Abstract | ||
| The behavior and performance of job shops have been the focus and attention in both operations research and operations management literature. Job shop scheduling has received this large amount of attention, because it has the potential to dramatically decrease costs and increase throughput, thereby, profits. Moreover, the increasing of product customization creates more job shop environment in manufacturing world. No doubt, a wide variety of approaches to the modeling and solution of job shop scheduling problems have been reported in the literature. But, the research in this area is continuous. In this paper, Multistage Heuristic Algorithm based on priority dispatching rules is developed. This algorithm has been implemented to solve three cases. Schedules generated have been compared with those obtained by means of the basic algorithm. As a result, Multistage Heuristic Algorithm shows the ability of minimizing: machines idle time, total time of machines and makespan. | ||
| Keywords | ||
| Multistage Heuristic Algorithm; Job shop scheduling; Priority dispatching rules; Make span; Machines idle time | ||
|
Statistics Article View: 379 PDF Download: 201 |
||