Home /Research /Robotic flowshop scheduling is strongly NP-complete
OTHER

Robotic flowshop scheduling is strongly NP-complete

Yves Crama, Joris van de Klundert

Year
1997
Citations
22

Abstract

peer reviewed

Keywords

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

Related papers

Browse all OTHER papers