The Best Student Paper Prize constitutes an exciting and challenging opportunity for young researchers to promote their works in the field of Project Management and Scheduling. The aim of this prize is to highlight the best outstanding works presented at the conference by Ph. D. students. All submitted papers to this challenging prize have been evaluated by the International Program Committee which will rank the three best papers.
Winner of the Best Student Paper Prize
Christian Eggermont TU Eindhoven, Netherlands Deadlock analysis for open shop processing systems We address three algorithmic problems in multi-stage open shop processing systems where job durations are unknown and there are no buffers, that are centered around reachability and deadlock detection. Download |
Ranked second
Lotte Berghman Department of Decision Sciences and Information Management KULeuven, Leuven, Belgium Competitive solutions for a dock assignment problem by means of Lagrangian relaxation Inspired by a practical case, we model a dock assignment problem with trailer transportation as a hybrid flow shop. It turns out that finding a feasible schedule is difficult, and ILOG CPLEX is unable to solve large instances to guaranteed optimality using a linear formulation. We therefore aim at finding high-quality feasible schedules in reasonable computation time with a Lagrangian algorithm. We propose an enumerative search tree to transform the solution of the Lagrangian relaxation into a feasible schedule by means of a problem-specific schedule generation scheme. Download |
Ranked third
Donatas Elvikis University of Kaiserslautern, Germany Scheduling two interfering job sets on uniform parallel machines with maximum criteria functions In this paper we have tackled the problem of scheduling two interfering job sets on uniform parallel machines with all jobs having equal processing times. We consider the case where both job sets are evaluated by means of general maximum cost functions and develop a sophisticated polynomial time algorithm to enumerate all strict Pareto optimal solutions. Download |