This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
Abstract. Combinatorial search methods often exhibit a large variability in performance. We study the cost pro les of combinatorial search procedures. Our study reveals some intrig...
Abstract—The discovery of locally and significantly correlated subpatterns within a two-dimensional dataset has recently become quite popular and is amongst others addressed by ...