
doi: 10.1002/nav.10044
AbstractWe 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
IR-71840, column generation, Deterministic scheduling theory in operations research, branch-and-price, interval scheduling, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Integer programming, crew scheduling, integer multicommodity flow
IR-71840, column generation, Deterministic scheduling theory in operations research, branch-and-price, interval scheduling, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Integer programming, crew scheduling, integer multicommodity flow
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
