Technical Note—Stopping Rules for Sequencing Problems

Paul H. Randolph, Gary Swinson and Carl Ellingsen
Additional contact information
Paul H. Randolph: New Mexico State University, Las Cruces, New Mexico, and University of Oslo, Oslo, Norway
Gary Swinson: Braddock, Dunn and McDonald, Huntington Beach, California
Carl Ellingsen: A/S Emma, Bergen, Norway

Operations Research, 1973, vol. 21, issue 6, 1309-1315

Abstract: Monte Carlo methods have been proposed for finding solutions to sequencing problems. One deficiency of these methods has been the absence of appropriate roles for stopping the sampling processes. This paper presents an interesting class of stopping rules that have been found useful in computational experience.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.6.1309 (application/pdf)

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:inm:oropre:v:21:y:1973:i:6:p:1309-1315

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().