Work Stretch Properties for the Scheduling of Continuous Operations Under Alternative Labor Policies

Lowerre, James M.

doi:10.1287/mnsc.23.9.963

Cited by 19 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Burns and Carter [5] use an iterative approach to deal with a situation where the employee requirement varies for each day of the week, each employee gets exactly 2 days off in a week, receives at least A out of every B weekends off, and has a maximum work stretch of 6 days. Their research generalizes the works of Brownell and Lowerre [3], Lowerre [10], Baker and Magazine [1], Burns [4], and Baker, Burns, and Carter [2]. Iterative scheduling algorithms differ from cyclic scheduling algorithms in that the long-run schedules experienced by individual workers need not be identical.…”

Section: Introductionmentioning

confidence: 70%

A set-processing algorithm for scheduling staff on 4-day or 3-day work weeks

Burns

Narasimhan

Smith

1998

Naval Research Logistics

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 70%

A set-processing algorithm for scheduling staff on 4-day or 3-day work weeks

Burns

Narasimhan

Smith

1998

Naval Research Logistics

View full text Add to dashboard Cite

“…Individualized rosters, on the other hand, can cater to the preferences of individual employees and adapt to fluctuations in demand levels more readily, but are more tedious to generate. Examples of work on cyclic scheduling are found in (Baker and Magazine, 1977;Burns and Koop, 1987;Emmons, 1985;Emmons and Burns, 1991 ;Koop, 1988;Lowerre, 1977;Panton, 1991). Individualized scheduling is Core stages in the general rostering model.…”

Section: Manpower Rostering Modelsmentioning

confidence: 99%

Automated manpower rostering: Techniques and experience

Khoong¹

1994

International Transactions in Operational Research

View full text Add to dashboard Cite

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

Work Stretch Properties for the Scheduling of Continuous Operations Under Alternative Labor Policies

Cited by 19 publications

References 2 publications

A set-processing algorithm for scheduling staff on 4-day or 3-day work weeks

A set-processing algorithm for scheduling staff on 4-day or 3-day work weeks

Automated manpower rostering: Techniques and experience

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

Contact Info

Product

Resources

About