Scheduling problem solving using genetic and greedy algorithms Online publication date: Mon, 27-Mar-2017
by A. Muthiah; R. Rajkumar
International Journal of Computer Aided Engineering and Technology (IJCAET), Vol. 9, No. 2, 2017
Abstract: Scheduling is an important tool for manufacturing and engineering, where it can have a major impact on the productivity of a process. In manufacturing, the purpose of scheduling is to minimise the production time and costs. Production scheduling aims to maximise the efficiency of the operation and reduce costs. The following approaches are used to solve the job shop problem. We keep all of our machines well-maintained to prevent any problems, but there is no way to completely prevent down-time. We can work to get our batch sizes as small as is reasonably possible while also reducing the setup time of each batch. This allows us to eliminate a sizable portion of each part waiting while the rest of the parts in the batch are being machined. In this paper, we propose the production scheduling problem solving using genetic and greedy algorithms with sequence dependant setup times considering the minimisation of the maximum completion time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Computer Aided Engineering and Technology (IJCAET):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook