Application of ELSP solution techniques to the deterministic robotic scheduling problem

Application of ELSP solution techniques to the deterministic robotic scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor1996859
Country: United Kingdom
Volume: 33
Issue: 10
Start Page Number: 2933
End Page Number: 2944
Publication Date: Oct 1995
Journal: International Journal of Production Research
Authors:
Abstract:

This paper studies the flexible deterministic robotic scheduling problem (FDRSP) where one tool changer (robot) is in charge of several machining operations and overlapping tool changes are not allowed. The relationship between the FDRSP and the economic lot scheduling problem (ELSP) is explored. The most promising solution techniques for the ELSP guaranteeing feasibility in advance are modified and applied to the FDSP. It is concluded that the basic period approach performs the best in small problems, while the rounding to powers of two approach is superior for medium to large problems.

Reviews

Required fields are marked *. Your email address will not be published.