Probabilistic ideas in heuristic algorithms for solving some scheduling problems

Heuristic algorithms for positioning a maximal number of independent units and constructing a schedule with minimal fleet size are proposed. These algorithms consist of two stages: defining the “leading” job and finding an optimal position for it. Decisions on both stages use some special criteria which have a probabilistic interpretation. Some experimental data are given.