A genetic algorithm-based schedule optimisation of a job shop with parallel resources
by Ahmad Wasim; Zawar A. Nawaz Bhatti; Mirza Jahanzaib; Salman Hussain
International Journal of Quality and Innovation (IJQI), Vol. 3, No. 2/3/4, 2017

Abstract: This paper presents a genetic algorithm for a job shop scheduling problem with parallel machines. The objective is to minimise the makespan. After solving an example, the performance of the proposed algorithm was examined on a set of test problems. The computational test was performed with moderate benchmark instances given in the literature. Now, many industrial work centres are shifting their focus towards implementation of job shop scheduling model. Large throughput and just-in-time restrictions have augmented the requirement of additional parallel machines at various production stages. This generates the scope for research on optimising job shop problem with parallel machines. However, research on this topic is very limited as compared to other job shop problems. A genetic algorithm has been proposed in this research work which effectively finds the near optimal makespan schedules for the job shop problem with parallel machines. The algorithm was implemented on the modified benchmarks from the literature and the results were compared with heuristics methods available in literature for solving this problem. It is shown that the proposed GA performs reasonably well when compared to the other techniques under consideration.

Online publication date: Tue, 20-Mar-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Quality and Innovation (IJQI):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com