首页 /研究 /Flow Shop Scheduling Problem with Transportation Times, Two-Robots and Inputs/Outputs with Limited Capacity
OTHER

Flow Shop Scheduling Problem with Transportation Times, Two-Robots and Inputs/Outputs with Limited Capacity

Tarik Lamoudan, Fatima El Khoukhi, A. El Alaoui, Jaouad Boukachour

发表年份
2012
引用次数
7
访问权限
开放获取

摘要

In this paper we study a generalized flow-shop problem with two identical transport robots between machines. Besides transportation times for the jobs, empty moving times for the robots are taken into account. The objective is to minimize the Makespan.

关键词

Scheduling (production processes)Flow shop schedulingComputer scienceRobotFlow (mathematics)Operations researchJob shop schedulingOperations managementEngineeringMathematics

相关论文

查看 OTHER 分类全部论文