Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/16763
Title: | A genetic algorithm-based scheduler for multiproduct parallel machine sheet metal job shop | Authors: | Chan, FTS Choy, KL Bibhushan |
Keywords: | Flexible job shop Genetic algorithm Multi-processor job shop Scheduling Simulation |
Issue Date: | 2011 | Publisher: | Pergamon Press | Source: | Expert systems with applications, 2011, v. 38, no. 7, p. 8703-8715 How to cite? | Journal: | Expert systems with applications | Abstract: | This paper presents a genetic algorithm-based job-shop scheduler for a flexible multi-product, parallel machine sheet metal job shop. Most of the existing research has focused only on permutation job shops in which the manufacturing sequence and routings are strictly in a predefined order. This effectively meant that only the jobs shops with little or no flexibility could be modeled using these models. The real life job shops may have flexibility of routing and sequencing. Our paper proposes one such model where variable sequences and multiple routings are possible. Another limitation of the existing literature was found to be negligence of the setup times. In many job shops like sheet metal shops, setup time may be a very sizable portion of the total make-span of the jobs, hence setup times will be considered in this work. One more flexibility type arises as a direct consequence of the routing flexibility. When there are multiple machines (parallel machines) to perform the same operation, the job could be routed to one or more of these machines to reduce the make-span. This is possible in situations where each job consists of a pre-defined quantity of a specified product. In other words, same job is quantity-wise split into two or more parts whenever it reduces the makespan. This effectively assumes that the setup cost is negligible. This model has been implemented on a real-life industry problem using VB.Net programming language. The results from the scheduler are found to be better than those obtained by simple sequencing rules. | URI: | http://hdl.handle.net/10397/16763 | ISSN: | 0957-4174 | EISSN: | 1873-6793 | DOI: | 10.1016/j.eswa.2011.01.078 |
Appears in Collections: | Journal/Magazine Article |
Show full item record
SCOPUSTM
Citations
22
Last Week
0
0
Last month
0
0
Citations as of Apr 11, 2018
WEB OF SCIENCETM
Citations
16
Last Week
0
0
Last month
1
1
Citations as of Apr 22, 2018
Page view(s)
65
Last Week
1
1
Last month
Citations as of Apr 23, 2018

Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.