This paper presents a review of the literature on personnel scheduling problems. Firstly, we
discuss the classification methods in former review papers. Secondly, we evaluate the …

Organizations need to focus on many parameters to reach their goals such as personnel
satisfaction at the top level, profit maximization, increasing system efficiency and minimizing …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Integrated Methods for Optimization will be used as a textbook in Optimization courses. It is a
well written book—John Hooker is an excellent expositor—and it will contain the appropriate …

In the service industry, it is crucial to efficiently allocate scarce resources to perform tasks
and meet particular service requirements. What considerably complicates matters is when …

We consider two approaches for solving the classical minimum vertex coloring problem—
that is, the problem of coloring the vertices of a graph so that adjacent vertices have different …

Shift scheduling problems (SSPs) are advanced NP-hard problems which are generally
evaluated with integer programming. This study presents an applicable shift schedule of …

The workforce scheduling problem in call centres is defined as assigning a number of
employees to various overlap** shifts during a specified planning horizon, considering …

Quantitative Methods in Supply Chain Management presents some of the most important
methods and tools available for modeling and solving problems arising in the context of …

We consider a real problem faced by a large company providing repair services of office
machines in Santiago, Chile. In a typical day about twenty technicians visit seventy …