A mixed integer programming model for rescheduling a robotic jobshop with reentrant and parallel mac

• 作 者: Jian-Guang Feng A-Da Che
• 机 构: SchoolofManagement,NorthwesternPolytechnicalUniversity,Xi'an710072
• 出 处: 中国运筹学会排序专业委员会第八次代表会议暨2013年学术交流年会
• 发表日期: 2013年10期
• 关键词: Rescheduling Robotic jobshop Mixed integer programming Time window constraints36

　　This paper deals with the robotic jobshop rescheduling problem with reentrant and parallel machines,where a part may visit some processing machines more than once and machines with multiple duplicate processing units may be used at some production stages with long processing times.The system is served by a robot for transporting parts among machines.The parts to be processed arrive randomly at the input station.When one or multiple parts arrive,an optimal reschedule should be determined based on the current state of the parts and the robot so as to minimize the makespan.We improve the mixed integer programming(MIP)model developed by Zhao et al.(2013)from the following aspects.First,we consider a more general robotic jobshop with reentrance.Second,we show that the solution obtained with Zhao et al.s model is not necessarily optimal.Third,we present a more compact MIP model than Zhao et al.s model in terms of the numbers of constraints and variables.We solve the model using commercial software CPLEX.Several numerical examples are used to test the proposed MIP model.