A probe-based algorithm for piecewise linear optimization in scheduling

A scheduling problem with piecewise linear (PL) optimization extends conventional scheduling by imposing a conjunction of combinatorial PL constraints involving the objective function variables. To solve this problem, this paper presents a hybrid algorithm where Constraint Programming (CP) search is supported and driven by a (integer) linear programming solver running on a well-controlled subproblem which is dynamically tightened. The paper discusses and compares different ways of decomposing the problem constraints between the CP search and the solver. We show how the subproblem structure and the piecewise linearity are exploited by the search.