A decomposition heuristic for rotational workforce scheduling
نویسندگان
چکیده
منابع مشابه
Heuristic decomposition and mathematical programming for workforce scheduling and routing problems
This thesis presents a PhD research project using a mathematical programming approach to solve a home healthcare problem (HHC) as well as general workforce scheduling and routing problems (WSRPs). In general, the workforce scheduling and routing problem consists of producing a schedule for mobile workers to make visits at different locations in order to perform some tasks. In some cases, visits...
متن کاملExact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive search. These smaller parts comprise a combination of choosing a method to select a task to be scheduled and a method to allocate resources, including time, to the selected task. We use reduced Variable Neighbourhood Sea...
متن کاملHierarchical decomposition heuristic for crude oil scheduling: a SINOPEC case
This work addresses the large-scale crude oil scheduling problem of China’s SINOPEC Maoming refinery importing various types of crude oil from two terminals via long-distance pipelines. A hierarchical decomposition approach is employed to construct a two-stage MILP model of the practical refinery operations. In the upper level model, storage and charging tanks are aggregated to determine the in...
متن کاملA Greedy Heuristic for Workforce Scheduling and Routing With Time-dependent Activities Constraints
We present a greedy heuristic (GHI) designed to tackle five time-dependent activities constraints (synchronisation, overlap, minimum difference, maximum difference and minimum-maximum difference) on workforce scheduling and routing problems. These types of constraints are important because they allow the modelling of situations in which activities relate to each other time-wise, e.g. synchronis...
متن کاملA Swift Heuristic Method for Work Order Scheduling under the Skilled-Workforce Constraint
The considered problem is how to optimally allocate a set of jobs to technicians of different skills such that the number of technicians of each skill does not exceed the number of persons with that skill designation. The key motivation is the quick sensitivity analysis in terms of the workforce size which is quite necessary in many industries in the presence of unexpected work orders. A time-i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2020
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-020-00659-2