A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering

John J. Bartholdi
Additional contact information
John J. Bartholdi: Georgia Institute of Technology, Atlanta, Georgia

Operations Research, 1981, vol. 29, issue 3, 501-510

Abstract: The problem of cyclic staff scheduling is solved by a linear programming round-off heuristic for which a bound on the absolute error is established. The quality of the bound is independent of the resource requirements. Moreover, the quality of the bound improves as the matrix of resource availability approximates the property of consecutive ones. The appropriateness of the heuristic is further established by showing that cyclic staff scheduling is NP -complete.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.3.501 (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:29:y:1981:i:3:p:501-510

Access Statistics for this article

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