Probabilistic ideas in heuristic algorithms for solving some scheduling problems

I. Gertsbach

Naval Research Logistics Quarterly, 1977, vol. 24, issue 2, 339-348

Abstract: 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.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800240212

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:24:y:1977:i:2:p:339-348

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().