An Exact Branch-and-Price Algorithm for Workforce Scheduling

Christoph Stark and Jürgen Zimmermann
Additional contact information
Christoph Stark: Clausthal University of Technology
Jürgen Zimmermann: Clausthal University of Technology

A chapter in Operations Research Proceedings 2004, 2005, pp 207-212 from Springer

Abstract: Abstract We consider a generic workforce scheduling problem, where employees are characterized by qualifications. Given a set of shifts for each day, we have to determine for each employee his working days as well as a specific shift for each working day. The overall objective is to find a set of feasible schedules with respect to hard and soft restrictions. We propose an integer multi-commodity network flow formulation for the problem under consideration and show how branch-and-price can be used to solve this problem.

Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-27679-1_26

Ordering information: This item can be ordered from
http://www.springer.com/9783540276791

DOI: 10.1007/3-540-27679-3_26

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().