Home /Research /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

Year
2002
Citations
9

Keywords

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

Related papers

Browse all OTHER papers