A hybrid MIP/CP approach for multi-activity shift scheduling

Authors:
Domenico Salvagnin;Toby Walsh
Affiliations:
DEI, University of Padova, Italy;NICTA and UNSW, Sydney, Australia
Venue:
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Year:
2012

Citing 13
Cited 0

Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces", 27)

Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces", 27)
A Cost-Regular Based Hybrid Column Generation Approach

Constraints
Integrated Methods for Optimization (International Series in Operations Research & Management Science)

Integrated Methods for Optimization (International Series in Operations Research & Management Science)
Modeling the Regular Constraint with Integer Programming

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The Polytope of Context-Free Grammar Constraints

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Decomposing global grammar constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A large neighbourhood search approach to the multi-activity shift scheduling problem

Journal of Heuristics
Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling

Management Science
Formal languages for integer programming modeling of shift scheduling problems

Constraints
The theory of grammar constraints

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Global grammar constraints

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Orbital shrinking

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.