  We consider here the MultiBot problem for the scheduling and the resource
parametrization of jobs related to the production or the transportation of
different products inside a given time horizon. Those jobs must meet known in
advance demands. The time horizon is divided into several discrete identical
periods representing each the time needed to proceed a job. The objective is to
find a parametrization and a schedule for the jobs in such a way they require
as less resources as possible. Though this problem derived from the applicative
context of reconfigurable robots, we focus here on fundamental issues. We show
that the resulting strongly NP-hard Multibot problem may be handled in a greedy
way with an approximation ratio of $\frac{4}{3}$.
