International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 45 - Number 13 |
Year of Publication: 2012 |
Authors: Swati Singh, Shruti Kapoor, Shelly Chikara, Vijai Singh |
10.5120/6843-9421 |
Swati Singh, Shruti Kapoor, Shelly Chikara, Vijai Singh . Improved Solution to Job Shop Scheduling Problem with Delay Constraints using Genetic Algorithm. International Journal of Computer Applications. 45, 13 ( May 2012), 34-39. DOI=10.5120/6843-9421
Job shop scheduling problem is one of the most difficult NP-hard combinatorial optimization problems. Therefore, determining an optimal schedule and controlling and it is considered a difficult task. To achieve high performance in manufacturing firms, a scheduling system should make the right decision at the right time according to system conditions. It is difficult for traditional optimization techniques to provide the best solution. This paper focuses on the problems of determination of a schedule with the objective of minimizing the total make span time. An attempt has been made to generate a schedule using Genetic Algorithm