OCTOBER 19-20, 2012 - YMCA University of Science & Technology

5. Results and discussions
Proceedings of the National Conference on
Trends and Advances in Mechanical Engineering,
YMCA University of Science & Technology, Faridabad, Haryana, Oct 19-20, 2012
In Job shop problem, first of all by visualizing the Gantt chart calculate completion time of the jobs on each machine,
idle time on each machine, loading time on each machine. Loading time is calculated by taking difference between
completion time of the jobs on each machine and idle time of each machine.
Job sequence for Scenario: J2-J1-J3-J4-J5-J6
GANNT CHART for Scenario with total completion time =61
In order to evaluate the effectiveness of the source code developed in MATLAB, it is first tested on the benchmark
problem [15] and later on, on several other problems [16]. The experimentations with these problems confirmed
that the source code developed in MATLAB is able to find good solutions of the addressed problem . Results
lie between the limits of upper bound & lower bound values [15] which are stated in various literatures, related to job
shop scheduling problems.
Overall the results indicate that the source code developed for finding the performance of this job shop scheduling
problem is able to generate the results which are comparable or better than the literature associated with this
problem. Currently, the source code generates the schedule which lies within the lower bound and upper bound of
the bench mark instances [15] taken from the literature. Comparison chart shows that results (calculated values)
lies between the limits of upper bound & lower bound values.
Comparison chart for scenario:-
830