1991
DOI: 10.1287/mnsc.37.11.1441
|View full text |Cite
|
Sign up to set email alerts
|

Sufficient Working Subsets for the Tour Scheduling Problem

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
48
0
1

Year Published

1993
1993
2010
2010

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 67 publications
(49 citation statements)
references
References 23 publications
0
48
0
1
Order By: Relevance
“…For each staffing/scheduling problem we used a custom C++ program to create the set of all feasible tours and the marginal revenue matrix r ti . Due to the large number of feasible tours, we formulated each staffing/scheduling problem with a working subset of feasible tours that were selected by Easton and Rossin's (1991) column generation procedure. IBM's (2000) OSL version 3.0 provided the shadow prices for the column generation algorithm and also solved the final integer program.…”
Section: Experimental Design and Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…For each staffing/scheduling problem we used a custom C++ program to create the set of all feasible tours and the marginal revenue matrix r ti . Due to the large number of feasible tours, we formulated each staffing/scheduling problem with a working subset of feasible tours that were selected by Easton and Rossin's (1991) column generation procedure. IBM's (2000) OSL version 3.0 provided the shadow prices for the column generation algorithm and also solved the final integer program.…”
Section: Experimental Design and Resultsmentioning
confidence: 99%
“…In general, the cardinality of the set of feasible tours increases with the amount of scheduling flexibility permitted by the organization's work rules. Mechanisms for efficiently generating feasible employee schedules from these parameters are discussed in Mabert and Watts (1982); Burns and Koop (1987); Easton and Rossin (1991); Jarrah, Bard, and deSilva (1994); Jacobs and Brusco (1996); and Brusco and Jacobs (1998); among others.…”
Section: Staffing/scheduling and Absence Recoverymentioning
confidence: 99%
“…Thompson [22] provides a reference for several of these prior computational studies along with the problem sizes and solution techniques. Easton and Rossin [8] use a column generation approach for solving the LP relaxation of the set covering type model for the tour scheduling problem. Then, as a heuristic, they determine the best integer solution using only the shifts generated to optimize the linear relaxation.…”
Section: Introductionmentioning
confidence: 99%
“…It covers both the days-off selection as well as the daily shift scheduling problem for a number of weekly working tours. To solve this complex optimization problem, different heuristic solution procedures based on linear programming and decomposition have been proposed (e.g., [18][19][20][21]). For a comparison of the approaches, see [22].…”
Section: Literature Reviewmentioning
confidence: 99%