Premium
A branch‐and‐price algorithm for a hierarchical crew scheduling problem
Author(s) -
Faneyte Diego B.C.,
Spieksma Frits C.R.,
Woeginger Gerhard J.
Publication year - 2002
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.10044
Subject(s) - crew scheduling , computer science , mathematical optimization , branch and price , integer programming , scheduling (production processes) , job shop scheduling , branch and cut , multi commodity flow problem , generalization , operations research , algorithm , flow network , mathematics , schedule , mathematical analysis , operating system
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