Computers and Operations Research
Computers and Industrial Engineering
A hybrid genetic algorithm for the job shop scheduling problems
Computers and Industrial Engineering
Heuristic methods for the identical parallel machine flowtime problem with set-up times
Computers and Operations Research
Computers and Operations Research
Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
Computers and Industrial Engineering - Special issue: Selected papers from the 31st international conference on computers & industrial engineering
Computers and Industrial Engineering - Special issue: Group technology/cellular manufacturing
Computers in Industry - Special issue: Application of genetics algorithms in industry
Genetic algorithm based on receding horizon control for arrival sequencing and scheduling
Engineering Applications of Artificial Intelligence
An adaptive genetic algorithm with dominated genes for distributed scheduling problems
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
A decision support system for production scheduling in an ion plating cell
Expert Systems with Applications: An International Journal
No-wait flexible flowshop scheduling with no-idle machines
Operations Research Letters
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Effect of solution representations on Tabu search in scheduling applications
Computers and Operations Research
Hi-index | 12.06 |
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.