Bi-objective coordinated production and transportation scheduling problem with sustainability: formulation and solution approaches

Author(s):  
Ece Yağmur ◽  
Saadettin Erhan Kesen
2016 ◽  
Vol 9 (2) ◽  
pp. 93-98 ◽  
Author(s):  
Chong Wang ◽  
◽  
Yun - sheng Mao ◽  
Bing - qiang Hu ◽  
Zhong - jie Deng ◽  
...  

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.


2022 ◽  
Author(s):  
Koki Meno ◽  
Ayanori Yorozu ◽  
Akihisa Ohya

Abstract In this study, a method was developed to address the automated guided vehicle (AGV) transportation scheduling problem. For deliveries in factories and warehouses, it is necessary to quickly plan a feasible transportation schedule without delay within a specified time. This study focused on obtaining a transport schedule without delay from the specified time while maintaining the search for a better solution during the execution of the transport task. Accordingly, a method was developed for constructing a solution with a two-dimensional array of delivery tasks for each AGV, arranged in the order in which they are executed, as well as for searching for a schedule by performing exchange and insertion operations. For the exchange and insertion, a method that considers the connectivity between the end point of a task and the start point of the next task was adopted. To verify the effectiveness of the proposed method, numerical simulations were performed assuming an actual transportation task.


Sign in / Sign up

Export Citation Format

Share Document