Skip to Main content Skip to Navigation

Cyclic Hoist Scheduling Problems in Classical and Sustainabl

Weidong Lei 1
1 OPERA - OPERA (OPtimisation Et RéseAux)
UTBM - Université de Technologie de Belfort-Montbeliard
Abstract : Automated treatment surface facilities, which employ computer-controlled hoists for part transportation, have been extensively established in various kinds of industrial companies, because of its numerous advantages over manual system, such as higher productivity, better product quality, and reduced labor intensity. Our research investigates three typical hoist scheduling problems with processing time windows in treatment surface facilities, which are: (I) cyclic single-hoist scheduling problem to minimize the cycle time; (II) cyclic single-hoist scheduling problem to minimize the cycle time and processing resource consumption (and consequently production cost); and (III) cyclic multi-hoist scheduling problem to minimize the cycle time.Due to the NP-completeness of the studied problems and numerous advantages of quantum-inspired evolutionary algorithm (QEA), we first propose a hybrid QEA with improved decoding mechanism and repairing procedure to find the best cycle time for the first problem. After that, to enhance with both the economic and environmental performance, which constitute two of the three pillars of the sustainable strategy nowadays deployed in many industries, we formulate a bi-objective mathematical model for the second problem by using the method of prohibited interval. Then we propose a bi-objective QEA with local search procedure to simultaneously minimize the cycle time and production cost, and we find a set of Pareto-optimal solutions for this problem. As for the third problem, we find that most existing approaches, such as mixed integer programming (MIP) approach, may identify a non-optimal solution to be an optimal one due to an assumption related to the loaded hoist moves which is made in many existing researches. Consequently, we propose an improved MIP approach for this problem by relaxing the above-mentioned assumption. Our approach can guarantee the optimality of its obtained solutions.For each problem, experimental study on industrial instances and random instances has been conducted. Computational results demonstrate that the proposed scheduling algorithms are effective and justify the choices we made.
Document type :
Complete list of metadatas

Cited literature [106 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Friday, March 29, 2019 - 4:47:10 PM
Last modification on : Thursday, March 5, 2020 - 3:33:15 PM
Long-term archiving on: : Sunday, June 30, 2019 - 3:52:32 PM


Version validated by the jury (STAR)


  • HAL Id : tel-02084684, version 1



Weidong Lei. Cyclic Hoist Scheduling Problems in Classical and Sustainabl. Automatic. Université de Technologie de Belfort-Montbeliard, 2014. English. ⟨NNT : 2014BELF0244⟩. ⟨tel-02084684⟩



Record views


Files downloads