Assigning scheduled tasks to a multi-skilled workforce is a known NP-complete problem with
many applications in health care, services, logistics and manufacturing. Optimising the use …

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

This paper presents an industrial problem which arises in a company specialized in drug
evaluation and pharmacology research. The aim is to build employee timetables covering …

To deal with their highly variable workload, logistics companies make their task force flexible
using multi-skilled employees, flexible working hours or short-term contracts. Together with …

The shift minimization personnel task scheduling problem is an NP-complete optimization
problem that concerns the assignment of tasks to multi-skilled employees with a view to …

In a cross-docking platform, goods are unloaded from inbound trucks, sorted and directly
reloaded in outbound trucks–each product typicallystays less than 24 hours in the platform …

The fixed interval scheduling problem—also known as the personnel task scheduling
problem—optimizes the allocation of available resources (workers, machines, or shifts) to …

Bu çalışmada, başlangıç ve bitiş zamanları belli olan bir grup görevin, türdeş olmayan bir
işgücünden en az sayıdaki çalışana atandığı bir vardiya enküçükleyen personel görev …

In this paper we describe a new approach for solving the shift minimisation personnel task
scheduling problem. This variant of fixed job scheduling problems arises when tasks with …

Bien que la gestion des ressources humaines soit une problématique bien étudiée, elle
reste d'actualité encore aujourd'hui, notamment en raison de la grande diversité des …