If you need an accessible version of this item please contact JSTOR User Support

A Quick Heuristic for Some Cyclic Staffing Problems with Breaks

Rakesh V. Vohra
The Journal of the Operational Research Society
Vol. 39, No. 11 (Nov., 1988), pp. 1057-1061
DOI: 10.2307/2583206
Stable URL: http://www.jstor.org/stable/2583206
Page Count: 5
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
A Quick Heuristic for Some Cyclic Staffing Problems with Breaks
Preview not available

Abstract

In this paper a linear time heuristic for a class of cyclic staffing problems with breaks is described. A novel feature of the heuristic is that the quality of the heuristic solution increases as the requirements for each period become more uniform. As a by-product of this work, a new class of polynomially solvable set-covering problems is identified.

Page Thumbnails

  • Thumbnail: Page 
1057
    1057
  • Thumbnail: Page 
1058
    1058
  • Thumbnail: Page 
1059
    1059
  • Thumbnail: Page 
1060
    1060
  • Thumbnail: Page 
1061
    1061