Introduction

Off-Line and Dynamic Production Scheduling – A Comparative Case Study

“…Some of the results on the Quintiq list have been obtained directly by the IBM solver and it has been checked that this solver generates results close to the best ones also for other instances. There are many methods of solving CP problems [35] and implementation of an efficient solver is a hard task. Thus, it is valuable that the tool exists which has the good performance for the classic FJS and this allows to expect that results will also be satisfying in the case of the LSR-FJS problem.…”

Exact interval propagation for the efficient solution of position analysis problems on planar linkages

“…Effectively, to compute the set P jk (α) = S k (e n |θ j = α) when α is a regular value of P kj (θ k ), first, equation (e n |θ j = α) will be rewritten using Eqs. (16)- (21), then, using the Find Range algorithm, the corresponding intervals I k and A k , defined as in (13), will be determined and their intersection found, and finally, if this intersection is not empty, the bounds for θ k will be obtained using (14). All of the functions involved in the process are continuous with respect to α, with the only exception of (20), which becomes undetermined just when α is a singular value of P kj (θ k ).…”

“…To isolate all feasible configurations, we embed the previous process in a standard branch-and-prune algorithm [14]. Two operators will be employed to this end, Trim-Box and Split-Box.…”

Semidefinite Programming and Constraint Programming

“…For more information on constraint programming we refer to the textbooks by Apt [2003] and Dechter [2003], and to the Handbook on Constraint Programming by Rossi et al [2006]. For more information on the integration of constraint programming and operations research we refer to Hooker [2000], Milano [2003] and Hooker [2007].…”