Elimination methods in the m × n sequencing problem

Wlodzimierz Szwarc

Naval Research Logistics Quarterly, 1971, vol. 18, issue 3, 295-305

Abstract: This paper considers elimination methods in solving the sequencing problem where no passing is permitted. An elimination method consists of reducing (according to some criterion) the initial set of n solutions to a smaller set. A crucial question arises as to whether this reduced set contains an optimal solution. The answer is affirmative if this elimination criterion implies condition (3).

Date: 1971
References: Add references at CitEc
Citations:

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

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:18:y:1971:i:3:p:295-305

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 ().