No Detail Found!

Using a hybrid genetic algorithm for minimizing the total completion time on parallel machines.

Author(s)
Mohammad Reza Jafarian Islamic Azad University, Ilam Branch, Ilam, Iran
Asma Sadat Hosseini Sama technical and vocational training college, Islamic Azad University, Neyshabur Branch, Neyshabur, Iran
Morteza Hatamkhani Sama technical and vocational training college, Islamic Azad University, Tonekabon Branch, Tonekabon, Iran
Mostafa Akhshabi Sama technical and vocational training college, Islamic Azad University, Tonekabon Branch, Tonekabon, Iran
Abstract
This paper aims at minimizing the total completion time. Jobs are processed by parallel machines. Due to the availability constraint, the completion time of a job is the time when a batch is totally processed. Considering due dates, the jobs need to be processed in a way that the total completion time is minimized. We propose a hybrid genetic algorithm, named GA-VNS. Based on a large set of instances, an experimental study has been carried out to evaluate our methods.
Publication Details
Page(s) 643-645
DOI DOI not available
Published Journal: Science International, Volume: 25, Issue: 3, Year: 2013

Request the full text from PASTIC

More from Science International
0

Citations

0

Downloads

37

Views

Copyright ©  PASTIC National Center, Islamabad www.pastic.gov.pk