Off-Day Scheduling with Hierarchical Worker Categories

Emmons, Hamilton; Burns, R. N.

doi:10.1287/opre.39.3.484

Cited by 51 publications

(16 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper generalizes the model proposed by Emmons and Burns (1991) and moves the frontiers of the research closer to real world problems characterized by coexistence of many shifts and categories of employees. As shown in section 3 of this paper, we cannot solve multiple shift problems optimally by simply treating them as many single shift problems for which optimal solution can be found.…”

Section: Introductionmentioning

confidence: 78%

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

Section: Introductionmentioning

confidence: 78%

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

show abstract

“…Accordingly, employees are assigned to categories such that each employee is able to substitute for employees from a lower category but not vice versa. To our knowledge Emmons and Burns [23] were the first to develop efficient algorithms for the "days-off-scheduling problem" with hierarchical personnel categories. More recently, integer programming and genetic algorithm based solution approaches have been developed to deal with heterogeneous workforce [24][25][26][27].…”

Section: Literature Reviewmentioning

confidence: 99%

“…usually the end of the day. Through constraints (23) it is guaranteed that the allocated personnel capacity always meets the requirements for each sub-set of tasks and each period (see also the example of figure 5 in section 3.2). The formulation of these constraints is based on the concept of feasibility constraints illustrated in section 3.3 by use of a simple single-period example.…”

Section: Objective Functionmentioning

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

“…Research on hierarchical workforce using combinatorial method can be traced back to [19]. The paper developed an algorithm for single shift workforce scheduling that generates feasible schedule under the assumption that each worker must have 2 off-days per week.…”

Section: Introductionmentioning

confidence: 99%

Production Planning for Make-to-Order Flow Shop System Under Hierarchical Workforce Environment

Piya

Al-Hinai

2015

Transactions on Engineering Technologies

View full text Add to dashboard Cite

In make-to-order system orders are scheduled for production based on the due date agreed with customer and the strategy of company. Production planning of such system includes scheduling of orders to the production periods and allocation of workers at different work centers. Complexity in the system arises when the operation to perform next and its processing time is skilled dependent where a higher qualified worker type can substitute a lower qualified one, but not vice-versa. Under such working environment, efficient scheduling of orders and allocation of workers at different work center play major role to improve system performance. This paper develops a mathematical model for make-to-order flow shop system under hierarchical workforce environment. The model helps identify optimum schedule of orders and allocation of workers with an objective of minimizing the weighted average earliness and tardiness. A heuristic method is also proposed to overcome the complexity of mathematical model and solve the problem efficiently. Numerical analysis indicates that proposed heuristic is capable of finding optimal or near optimal solution in a considerably reduced amount of computational timing.

show abstract

Off-Day Scheduling with Hierarchical Worker Categories

Cited by 51 publications

References 11 publications

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

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

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

Production Planning for Make-to-Order Flow Shop System Under Hierarchical Workforce Environment

Contact Info

Product

Resources

About