A Position-Based Propagator for the Open-Shop Problem

Abstract

Abstract. The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree but they usually do not consider the absolute ordering of the tasks. In this work, we develop a new propagator for the One-Machine Non-Preemptive Problem, the basic constraint for the Open-Shop Problem. This propagator takes this additional information into account allowing, in most cases, a reduction of the search tree. The underlying principle is to use shaving on the positions. Our propagator applies on one machine or one job and its time complexity is in O(N 2 log N ), where N is either the number of jobs or machines. Experiments on the Open-Shop Problem show that the propagator adds pruning to state-of-the-art constraint satisfaction techniques to solve this problem.

Uma nova abordagem para o Problema de Balanceamento de Currículo Acadêmico

“…Por ser classificado como um problema NP-Difícil, alguns autores propuseram métodos baseados em meta-heurísticas como Algoritmo Genético (Lambert, Castro, Monfroy, & Saubion, 2006;Castro, Crawford, & Monfroy, 2009;Chakradhar et al, 2019;Villalobos-Cid, Orellana, Vasquez, Pinto-Sothers, & Inostroza-Ponta, 2019), Colonia de Formigas (Rubio et al, 2013), Algoritmos dos Vaga-lumes (Rubio, Soto, Jorquera, Aguilera, & Vidal, 2018;Rubio et al, 2021;Yin et al, 2023) e outros baseados em busca local (Monette, Deville, Dupont, Deville, & Dupont, 2007;Gaspero & Schaerf, 2008).…”

Solving scheduling problems from high-level models

“…In particular, we present two propagators of global constraints for scheduling problems. The first one is based on the positions of activities to propagate the disjunctive resource constraint (Monette et al 2007). The second one propagates the minimization of the sum over all activities of the earliness and tardiness costs (a socalled Just-In-Time objective function).…”