A Modular Approach to Optimal Multiple-Shift Manpower Scheduling

Burns, R. N.; Koop, G. J.

doi:10.1287/opre.35.1.100

Cited by 56 publications

(18 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the operations research literature different heuristic (eg Blau and Sear, 1983;Burns and Koop, 1987;Kostreva and Jennings, 1991) and meta-heuristic approaches such as simulated annealing (eg Brusco and Jacobs, 1993), tabu search (eg Dowsland, 1998;Burke et al, 1999), genetic algorithms (eg Aickelin and Dowsland, 2000;Burke et al, 2001;Maenhout and Vanhoucke, 2008a), scatter search (eg Maenhout and Vanhoucke, 2006), and electromagnetic-like meta-heuristic (Maenhout and Vanhoucke, 2007) are encountered among others.…”

Section: Nurse Rostering Solution Proceduresmentioning

confidence: 99%

The impact of incorporating nurse-specific characteristics in a cyclical scheduling approach

Maenhout

Vanhoucke

2009

Journal of the Operational Research Society

View full text Add to dashboard Cite

Nursing staff in various hospitals in Belgium are principally cyclically scheduled. The employed cyclic schedules embody, however, only a weak reflection of the ultimate nurse rosters constructed for a specific month. In this paper, we investigate the benefits of integrating nurse-specific characteristics in the cyclic scheduling approach. Moreover, we analyse to what extent these characteristics should be incorporated and compare this approach with a general and more robust cyclical scheduling approach and the flexible acyclical rostering of nursing personnel.

show abstract

Section: Nurse Rostering Solution Proceduresmentioning

confidence: 99%

The impact of incorporating nurse-specific characteristics in a cyclical scheduling approach

Maenhout

Vanhoucke

2009

Journal of the Operational Research Society

View full text Add to dashboard Cite

show abstract

“…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%

Development of a Decision Support Model for Scheduling Clinical Studies and Assigning Medical Personnel

Grunow

Günther

Yang

2004

Health Care Manage Sci

View full text Add to dashboard Cite

Clinical studies for the development of new drugs in the pharmaceutical industry consist of a number of individual tasks which have to be carried out in a pre-defined chronological order. Each task requires certain types of medical personnel. This paper investigates the scheduling of clinical studies to be performed during a short-term planning horizon, the allocation of workforce between the studies, and the assignment of individual employees to tasks. Instead of developing a complex monolithic decision model, a hierarchical modelling approach is suggested. In the first stage, a compact integer optimization model is solved in order to determine the start-off times of the studies and the required staffing while taking the limited availability of personnel into account. The objective is to minimize total staffing costs. The assignment of individual employees to tasks is then made in the second stage of the procedure using a binary optimization model.

show abstract

“…Optimal solutions to some single shift problems with single or many categories of employees and multiple shift problems with a single category of employees have been found. Burns and Carter (1985) deal with a problem having a single shift and a single category of employees generalizing the research done earlier by Brownell and Lowerre (1976), Lowerre (1977), Baker and Magazine (1977), Burns (1978) and Baker, Burns and Carter (1979), Burns and Koop (1987) provide a modular approach for finding optimal solution to workforce scheduling problems characterized by multiple shifts and a single category of employees. Burns (1981) describes an iterative algorithm for the same problem, Emmons and Burns (1991) discuss a cyclic algorithm for single shift scheduling problem with many categories of employees.…”

Section: Introductionmentioning

confidence: 99%

An Algorithm For Multiple Shift Scheduling of Hierarchical Workforce On Four-Day Or Three-Day Workweeks

Narasimhan

2000

INFOR: Information Systems and Operational Research

View full text Add to dashboard Cite

This paper presents an optimal algorithm for multiple shift scheduling of hierarchical categories of employees on four-^day or three-day workweeks. Employees work four days (three days in the case of three-day workweek) each week, have at least a fraction A out of every B weekends off, work no more than four (three in the case of threeday workweek) consecutive days in a workstretch and have at least some prescribed number of hours off when changing shifts. Such contexts exist in many seven-daya-week manufacturing and service organizations such as paper mills, steel plants and hospitals. We determine the most economical mix of categories of employees satisfying scheduling constraints under a pattem of demand for employees. The pattern is such that the weekday demand is greater than or equal to the weekend demand for each category and each shift. We then present an algorithm to construct feasible work schedules by assigning offdays and shifts to employees. We establish that the work schedules satisfy all the scheduling constraints and meet the pattern of demand. This paper extends the frontiers of research closer to real world contexts by considering the simultaneous prevalence of multiple shifts and hierarchical workforce. RESUME L'article qui suit presente un algorithme optimal pour organiser les postes multiples de categories d'employe(e)s ou de travailleurs/travailleuses dans une entreprise fonctionnant selon un modele hierarchique, et sur une semaine de travail de trois ou de quatre jours. Les employe(e)s travaillent quatre jours par semaine (trois jours dans le cas d'une semaine de travail de trois jours), Ils/EUes auront au moins une fraction A de B de fin de semaine libre, ils/elles ne travailleront pas plus de quatre jours consecutife (trois dans le cas d'une semaine de travail de trois jours) et ils/elles auront au moins un nombre predetermine d'heures libres lorsqu ils/elles changeront de poste. On opere selon ce mode de fonctionnement dans les organismes de produits et de services comme les papeteries, les acieries et les hopitaux, qui doivent fonctionner sans interruption sept jours sur sept. On determine la combinaison la plus economique de categories d'employe(e)s ou de travailleurs/travailleuses qui puisse satisfaire les contraintes de l'horaire, en fonction de la tendance a la demande pour certain(e)s employe(e)s ou travailleurs/travailleuses, Cette tendance est telle que la demande du lundi au vendredi est soit egale a la demande des fins de semaine pour chaque categorie ou chaque poste, soit plus grande qu'elle. On presente ensuite un algorithme qui construit un horaire de travail realisable en attribuant des jours de conge et des postes aux employe(e)s et travailleurs/travailleuses. On constate que ces horaires satisfont a toutes les contraintes et repondent a la tendance de la demande, Cet article rapproche la recherche theorique des contextes reels du monde du travail en prenant en compte la double priorite de la multiplicite des postes et de la hierarchie des travailleurs/travailleuses ou des...

show abstract

A Modular Approach to Optimal Multiple-Shift Manpower Scheduling

Cited by 56 publications

References 13 publications

The impact of incorporating nurse-specific characteristics in a cyclical scheduling approach

The impact of incorporating nurse-specific characteristics in a cyclical scheduling approach

Development of a Decision Support Model for Scheduling Clinical Studies and Assigning Medical Personnel

An Algorithm For Multiple Shift Scheduling of Hierarchical Workforce On Four-Day Or Three-Day Workweeks

Contact Info

Product

Resources

About