Sufficient Working Subsets for the Tour Scheduling Problem

Fred F. Easton and Donald F. Rossin
Additional contact information
Fred F. Easton: School of Management, Syracuse University, Syracuse, New York 13244-2130
Donald F. Rossin: Owen Graduate School of Management, Vanderbilt University, Nashville, Tennessee 37203

Management Science, 1991, vol. 37, issue 11, 1441-1451

Abstract: Mathematical programs to schedule service employees at minimum cost represent each feasible schedule, or tour, with an integer variable. In some service organizations, policies governing employee scheduling practices may permit millions of different tours. A common heuristic strategy is to reformulate the problem from a small working subset of the feasible tours. Solution quality depends on the number and types of schedules included in the model. This paper describes a working subset heuristic based on column generation. The method is general and can accommodate a mix of full- and part-time employees. Experiments revealed its formulations had objective values indistinguishable from those of models using all feasible tours, and significantly lower than those generated by alternative working subset procedures.

Keywords: column generation; staffing and scheduling; service operations (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.37.11.1441 (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:ormnsc:v:37:y:1991:i:11:p:1441-1451

Access Statistics for this article

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