A branch-and-price algorithm for a hierarchical crew scheduling problem
β Scribed by Diego B.C. Faneyte; Frits C.R. Spieksma; Gerhard J. Woeginger
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 122 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We describe a realβlife problem arising at a crane rental company. This problem is a generalization of the basic crew scheduling problem given in Mingozzi et al. [18] and Beasley and Cao [6]. We formulate the problem as an integer programming problem and establish ties with the integer multicommodity flow problem and the hierarchical interval scheduling problem. After establishing the complexity of the problem we propose a branchβandβprice algorithm to solve it. We test this algorithm on a limited number of realβlife instances. Β© 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723β742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10044
π SIMILAR VOLUMES
## Abstract The capacitated __p__βmedian problem is the variation of the wellβknown __p__βmedian problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We
## Abstract This paper presents a branchβandβprice algorithm for scheduling __n__ jobs on __m__ nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of __Ο__ priority classes and may require two operations. The objective i
We present a branch-and-price technique for optimal staff scheduling with multiple rest breaks, meal break, and break windows. We devise and implement specialized branching rules suitable for solving the set covering type formulation implicitly, using column generation. Our methodology is more widel