首页 /研究 /Makespan minimization for flow-shop problems with transportation times and a single robot
OTHER

Makespan minimization for flow-shop problems with transportation times and a single robot

Johann L. Hurink, Sigrid Knust

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

关键词

Job shop schedulingFlow shop schedulingMinificationScheduleRobotConstant (computer programming)Flow (mathematics)MathematicsMathematical optimizationTransportation theory

相关论文

查看 OTHER 分类全部论文