首页 /研究 /Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment
OTHER

Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment

Peter Brucker, Sigrid Knust

发表年份
2002
引用次数
9

关键词

Travelling salesman problemColumn generationTheory of computationMathematical optimizationJob shop schedulingScheduling (production processes)Computer scienceRobotGeneralizationMathematics

相关论文

查看 OTHER 分类全部论文