A discrete model of one-stage service for a group of stationary objects is considered. The objects are located
along a one-dimensional working zone of two counter-moving mobile processors. Each object is associated with a
pair of monotonically increasing penalty functions. Synthesis problems are formulated in the criteria plane of a full
set of effective estimates and corresponding Pareto-optimal service strategies. Recurrence relations of dynamic programming
are derived; their implementation algorithms and the technology of service strategies are presented.
|
