Integrated production scheduling and maintenance planning in a hybrid flow shop system: a multi-objective approach

Author(s):  
Mostafa Zandieh ◽  
Seyed Mojtaba Sajadi ◽  
Reza Behnoud
2021 ◽  
Author(s):  
Wangming Li ◽  
Dong Han ◽  
Liang Gao ◽  
Xinyu LI ◽  
Yang Li

Abstract The connection between production scheduling and transportation scheduling is getting closer in smart manufacturing system, both of which are summarized as NP-hard problems. However, only a few studies have considered them simultaneously. This paper studies the integrated production and transportation scheduling problem (IPTSP) in hybrid flow shop, which is an extension of the hybrid flow shop scheduling problem (HFSP). In this problem, the transfer tasks of jobs are performed by a certain number of automated guided vehicles (AGV). In addition to the production scheduling on machines, we consider the transportation scheduling on AGVs as the part of the optimization process. To solve it, we make some preparation (including the establishment of task pool, the new solution representation and the new solution evaluation), which can help algorithm efficiently find satisfactory solutions while appropriately limiting the search space. Then, an effective genetic tabu search algorithm is used to minimize the makespan. Finally, two groups of instances are designed and three types of experiments are conducted to evaluate the performance of proposed method. The results show that the proposed method can achieve good results, showing the effectiveness of the presented approach.


Author(s):  
Binghai Zhou ◽  
Wenlong Liu

Increasing costs of energy and environmental pollution is prompting scholars to pay close attention to energy-efficient scheduling. This study constructs a multi-objective model for the hybrid flow shop scheduling problem with fuzzy processing time to minimize total weighted delivery penalty and total energy consumption simultaneously. Setup times are considered as sequence-dependent, and in-stage parallel machines are unrelated in this model, meticulously reflecting the actual energy consumption of the system. First, an energy-efficient bi-objective differential evolution algorithm is developed to solve this mixed integer programming model effectively. Then, we utilize an Nawaz-Enscore-Ham-based hybrid method to generate high-quality initial solutions. Neighborhoods are thoroughly exploited with a leader solution challenge mechanism, and global exploration is highly improved with opposition-based learning and a chaotic search strategy. Finally, problems in various scales evaluate the performance of this green scheduling algorithm. Computational experiments illustrate the effectiveness of the algorithm for the proposed model within acceptable computational time.


2014 ◽  
Vol 1082 ◽  
pp. 529-534
Author(s):  
Zheng Ying Lin ◽  
Wei Zhang

Due to several mutual conflicting optimized objectives in the hybrid flow shop scheduling problem, its optimized model, including three objectives of make-span, flow-time and tardiness, was firstly set up, instead of the single optimized objective. Furthermore, in order to improve the optimized efficiency and parallelism, after comparing the normal multi-objective optimized methods, an improved NSGA-II algorithm with external archive strategy was proposed. Finally, taking a piston production line as example, its performance was tested. The result showed that the multi-objective optimization of hybrid flow shop scheduling based on improved NSGA-II provided managers with a set of feasible solutions for selection in accordance to their own preference. Therefore the decision could be made more scientific and efficient, and thus brings to the factory more economic benefits.


2018 ◽  
Vol 19 (2) ◽  
pp. 148
Author(s):  
Siti Muhimatul Khoiroh

Production scheduling is one of the key success factors in the production process. Scheduling approach with Non-Permutation flow shop is a generalization of the traditional scheduling problems Permutation flow shop for the manufacturing industry to allow changing the job on different machines with the flexibility of combinations. This research tries to develop a heuristic approach that is non-delay algorithm by comparing Shortest Processing Time (SPT) and Largest Remaining Time (LRT) in the case of non-permutation flow shop to produce minimum mean flow time ratio. The result of simulation shows that the SPT algorithm gives less mean flow time value compared to LRT algorithm which means that SPT algorithm is better than LRT in case of non-permutation hybrid flow shop.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 151180-151194 ◽  
Author(s):  
Qiang Cheng ◽  
Chenfei Liu ◽  
Hongyan Chu ◽  
Zhifeng Liu ◽  
Wei Zhang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document