Single elevator scheduling problem with complete information: An exact model using mixed integer linear programming

Author(s):  
Jingyang Xu ◽  
Tianke Feng
2016 ◽  
Vol 2016 ◽  
pp. 1-11
Author(s):  
Huizhi Ren ◽  
Shenshen Sun

A special parallel production lines scheduling problem is studied in this paper. Considering the time window and technical constraints, a mixed integer linear programming (MILP) model is formulated for the problem. A few valid inequalities are deduced and a hybrid mixed integer linear programming/constraint programming (MILP/CP) decomposition strategy is introduced. Based on them, a hybrid integer programming/genetic algorithm (IP/GA) approach is proposed to solve the problem. At last, the numerical experiments demonstrate that the proposed solution approach is effective and efficient.


Sign in / Sign up

Export Citation Format

Share Document