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 FDRSP. 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.