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

Year
2001
Citations
87
Access
Open access

Keywords

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

Related papers

Browse all OTHER papers