As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
We present a new Constraint Programming (CP) model to optimize the transition cost of Fixed Job Scheduling (FJS), which improves our previous approach based on per-resource constraints by orders of magnitude. Our new model relies on a much tighter relaxation which encompasses all resources to directly propagate on the global cost, thanks to the MinWeightAllDiff optimization constraint.
We also present several strategies which exploit the optimal matching computed by the MinWeightAllDiff constraint to efficiently guide the search. The resulting CP solver, using parallel cooperation between the strategies, consistently outperforms a state-of-the-art MIP solver on real instances of an FJS application, the Gate Allocation Problem, at Paris-Charles-de-Gaulle international airport.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.