Integrated scheduling of distributed service resources for complex equipment considering multiple on-site MRO tasks

Author(s):  
Xingdong Zhao ◽  
Qianwang Deng ◽  
Xiahui Liu ◽  
Like Zhang ◽  
Shengcong Wu ◽  
...  
2013 ◽  
Vol 32 (7) ◽  
pp. 2053-2055
Author(s):  
Jun-le DU ◽  
Liang-hua XIA ◽  
Wei-wei QI ◽  
Jian-bin DOU

2020 ◽  
Vol 14 (16) ◽  
pp. 3079-3087
Author(s):  
Yun Zhou ◽  
Hao Su ◽  
Qiang Gui ◽  
Lei Gan ◽  
Donghan Feng ◽  
...  

Author(s):  
Yingchun Xia ◽  
Zhiqiang Xie ◽  
Yu Xin ◽  
Xiaowei Zhang

The customized products such as electromechanical prototype products are a type of product with research and trial manufacturing characteristics. The BOM structures and processing parameters of the products vary greatly, making it difficult for a single shop to meet such a wide range of processing parameters. For the dynamic and fuzzy manufacturing characteristics of the products, not only the coordinated transport time of multiple shops but also the fact that the product has a designated output shop should be considered. In order to solve such Multi-shop Integrated Scheduling Problem with Fixed Output Constraint (MISP-FOC), a constraint programming model is developed to minimize the total tardiness, and then a Multi-shop Integrated Scheduling Algorithm (MISA) based on EGA (Enhanced Genetic Algorithm) and B&B (Branch and Bound) is proposed. MISA is a hybrid optimization method and consists of four parts. Firstly, to deal with the dynamic and fuzzy manufacturing characteristics, the dynamic production process is transformed into a series of time-continuous static scheduling problem according to the proposed dynamic rescheduling mechanism. Secondly, the pre-scheduling scheme is generated by the EGA at each event moment. Thirdly, the jobs in the pre-scheduling scheme are divided into three parts, namely, dispatched jobs, jobs to be dispatched, and jobs available for rescheduling, and at last, the B&B method is used to optimize the jobs available for rescheduling by utilizing the period when the dispatched jobs are in execution. Google OR-Tools is used to verify the proposed constraint programming model, and the experiment results show that the proposed algorithm is effective and feasible.


2016 ◽  
Vol 44 (1) ◽  
pp. 1-12 ◽  
Author(s):  
David Gamarnik ◽  
John N. Tsitsiklis ◽  
Martin Zubeldia

Sign in / Sign up

Export Citation Format

Share Document