We propose a hybrid MIP/CP approach for solving multi-activity shift scheduling problems, based on regular languages that partially describe the set of feasible shifts. We use an aggregated MIP relaxation to capture the optimization part of the problem and to get rid of symmetry. Whenever the MIP solver generates a integer solution, we use a CP solver to check whether it can be turned into a feasible solution of the original problem. A MIP-based heuristic is also developed. Computational results are reported, showing that the proposed method is a promising alternative compared to the state-of-the-art. © 2012 Springer-Verlag.
CITATION STYLE
Salvagnin, D., & Walsh, T. (2012). A hybrid MIP/CP approach for multi-activity shift scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7514 LNCS, pp. 633–646). https://doi.org/10.1007/978-3-642-33558-7_46
Mendeley helps you to discover research relevant for your work.