Bicriterial servicing problems for stationary objects in a one-dimensional working zone of a processor

We consider the single‐stage servicing model for a group of stationary objects distributed along a one‐dimensional working zone of a moving processor. Each object is associated with an individual penalty function with respect to one or two criteria; we consider total penalty minimization and maximal individual penalty minimization criteria. For these bicriterial problems, we study the problems of constructing complete collections of efficient estimates and synthesizing Pareto‐optimal solutions; we also consider the computational complexity of the resulting problems.