NDLI: Network flow models for intraday personnel scheduling problems

Content Provider	Springer Nature Link
Author	Brucker, Peter Qu, Rong
Copyright Year	2012
Abstract	Personnel scheduling problems can be decomposed into two stages. In the first stage for each employee the working days have to be fixed. In the second stage for each day of the planning period an intraday scheduling problem has to be solved. It consists of the assignment of shifts to the employees who have to work on the day and for each working period of an employee a task assignment such that the demand of all tasks for personnel is covered. In Robinson et al. (Burke and Trick (Eds.), Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling, 18th August–20th August 2004, Pittsburgh, PA, USA, pp. 561–566, 2005), the intraday problem has been formulated as a maximum flow problem. The assumptions are that, employees are qualified for all tasks, their shifts are given, and they are allowed to change tasks during the day.In this work, we extend the network flow model to cover the case where not all employees are qualified to perform all tasks. The model is further extended to be able to calculate shifts of employees for the given day, assuming that an earliest starting time, a latest finishing time, and a minimal working time are given. Labour cost can be also taken into account by solving a minimum cost network flow problem.
Starting Page	107
Ending Page	114
Page Count	8
File Format	PDF
ISSN	02545330
Journal	Annals of Operations Research
Volume Number	218
Issue Number	1
e-ISSN	15729338
Language	English
Publisher	Springer US
Publisher Date	2012-11-14
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Personnel scheduling Assignment problem Network flows Operations Research/Decision Theory Combinatorics Theory of Computation
Content Type	Text
Resource Type	Article
Subject	Management Science and Operations Research

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning

A heuristic algorithm based on multi-assignment procedures for nurse scheduling

Assignment problems with changeover cost

The crane scheduling problem: models and solution approaches

Semidefinite relaxations for partitioning, assignment and ordering problems

Models and solution techniques for frequency assignment problems

A permutation flow-shop scheduling problem with convex models of operation processing times

A note on asymptotic formulae for one-dimensional network flow problems

A Neural Network Application in Personnel Scheduling

Network flow models for intraday personnel scheduling problems

Similar Documents

Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning

A heuristic algorithm based on multi-assignment procedures for nurse scheduling

Assignment problems with changeover cost

The crane scheduling problem: models and solution approaches

Semidefinite relaxations for partitioning, assignment and ordering problems

Models and solution techniques for frequency assignment problems

A permutation flow-shop scheduling problem with convex models of operation processing times

A note on asymptotic formulae for one-dimensional network flow problems

A Neural Network Application in Personnel Scheduling

Network flow models for intraday personnel scheduling problems