COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING

On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems

Enumerative approaches, such as branch-and-bound, to solving optimization problems require a subroutine that produces a lower bound on the value of the optimal solution. In the domain of scheduling problems the requisite lower bound has typically been derived from either the solution to a linear-programming relaxation of the problem or the solution of a combinatorial relaxation. In this paper w...

Construction heuristics for hard combinatorial optimisation problems

Multi-objective Solution Approaches for Employee Shift Scheduling Problems in Service Sectors (RESEARCH NOTE)

Today, workforce scheduling programs are being implemented in many production and service centers. These sectors can provide better quality products and/or services to their customers, taking into account employees’ desires and preferences in order to increase sector productivity. In this study, an employee shift scheduling problem in the service sector is discussed. In the problem, the aim is ...

Combinatorial Models for Multi-agent Scheduling Problems

Scheduling models deal with the best way of carrying out a set of jobs on given processing resources. Typically, the jobs belong to a single decision maker, who wants to find the most profitable way of organizing and exploiting available resources, and a single objective function is specified. If different objectives are present, there can be multiple objective functions, but still the models r...

Combinatorial algorithms for packing and scheduling problems