首页 /研究 /Robotic flowshop scheduling is strongly NP-complete
OTHER

Robotic flowshop scheduling is strongly NP-complete

Yves Crama, Joris van de Klundert

发表年份
1997
引用次数
22

摘要

peer reviewed

关键词

Computer scienceScheduleScheduling (production processes)Job shop schedulingRobotMathematical optimizationOperations researchArtificial intelligenceMathematicsOperating system

相关论文

查看 OTHER 分类全部论文