BICRITERIA MODEL AND SYNTHESIS ALGORITHMS OF OPTIMAL COMPROMISE STRATEGIES FOR SINGLE PROCESSOR SERVICING OF A LINEAR GROUP OF STATIONARY OBJECTS |
| 1 | |
| 2012 |
| scientific article | 519.8 + 681.3 | ||
| 175-181 | discrete model of servicing, Pareto-optimal strategies, dynamic programming, metaheuristic algorithms |
| A discrete model of single-stage servicing of a group of stationary objects is considered. The objects are located along a one-dimensional working zone of a mobile processor. 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 allowing us to build the entire Pareto domain are derived. Special attention is paid to the synthesis algorithms of suboptimal servicing strategies. |
 |