The Preemptive Just-in-time Scheduling Problem in a Flow Shop Scheduling System
Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as hold...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Islamic Azad University, Qazvin Branch
2019-07-01
|
| Series: | Journal of Optimization in Industrial Engineering |
| Subjects: | |
| Online Access: | http://www.qjie.ir/article_538173_e460439ed3ee984c759e79b704076c98.pdf |
| Summary: | Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs. In this paper, just-in-time (JIT) flow shop scheduling problem with preemption and machine idle time assumptions is considered in which objective function is minimizing the sum of weighted earliness and tardiness. A new non-linear mathematical model is formulated for this problem and due to high complexity of the problem meta-heuristic approaches have been applied to solve the problem for finding optimal solution. The parameters of algorithms are set by Taguchi method. Each parameter is tested in three levels. By implementation of many problems with different sizes these levels are determined .The proposed model is solved by three meta-heuristic algorithms: genetic algorithm (GA), imperialist competitive algorithm (ICA) and hybrid of GA and ICA. To evaluate the performance of the proposed algorithms many test problems have been designed. The Computational results indicate the superiority of the performance of hybrid approach than GA and ICA in finding thebest solution in reasonable computational time. |
|---|---|
| ISSN: | 2251-9904 2423-3935 |