scispace - formally typeset
P

Philippe De Bruecker

Researcher at Katholieke Universiteit Leuven

Publications -  20
Citations -  1359

Philippe De Bruecker is an academic researcher from Katholieke Universiteit Leuven. The author has contributed to research in topics: Aircraft maintenance & Schedule. The author has an hindex of 10, co-authored 20 publications receiving 1140 citations. Previous affiliations of Philippe De Bruecker include Hogeschool-Universiteit Brussel.

Papers
More filters
Journal ArticleDOI

Personnel scheduling: A literature review

TL;DR: This paper presents a review of the literature on personnel scheduling problems and discusses the classification methods in former review papers, and evaluates the literature in the many fields that are related to either the problem setting or the technical features.
Journal ArticleDOI

Workforce Planning Incorporating Skills: State of the Art

TL;DR: A review and classification of the literature regarding workforce planning problems incorporating skills to present a combination of technical and managerial knowledge to encourage the production of more realistic and useful solution techniques.
Journal ArticleDOI

Workforce planning incorporating skills: State of the art

TL;DR: A review and classification of the literature regarding workforce planning problems incorporating skills is presented in this paper, where the authors present a combination of technical and managerial knowledge to encourage the production of more realistic and useful solution techniques.
Journal ArticleDOI

Integrated staffing and scheduling for an aircraft line maintenance problem

TL;DR: An enumerative algorithm with bounding in which each node of the enumeration tree represents a mixed integer linear problem (MILP) such that it becomes tractable for commercial MILP solvers.
Journal ArticleDOI

A model enhancement approach for optimizing the integrated shift scheduling and vehicle routing problem in waste collection

TL;DR: The model enhancement approach accurately estimates the required collection times and therefore consistently finds a feasible solution and the solutions not only result in considerable savings, but are also proven to be (near)optimal by comparison with a practical lower bound based on flexible routes.