scholarly journals Solution approaches to large shift scheduling problems

2008 ◽  
Vol 42 (2) ◽  
pp. 229-258 ◽  
Author(s):  
Monia Rekik ◽  
Jean-François Cordeau ◽  
François Soumis
Keyword(s):  
Scheduling Problems ◽  
Shift Scheduling ◽  
Large Shift

An implicit model for multi-activity shift scheduling problems

2017 ◽  
Vol 21 (3) ◽  
pp. 285-304 ◽  
Author(s):  
Sana Dahmen ◽  
Monia Rekik ◽  
François Soumis
Keyword(s):  
Scheduling Problems ◽  
Shift Scheduling ◽  
Implicit Model

An integrated algorithm for shift scheduling problems for local public transport companies

Omega ◽  
2018 ◽  
Vol 75 ◽  
pp. 139-153 ◽  
Author(s):  
Claudio Ciancio ◽  
Demetrio Laganà ◽  
Roberto Musmanno ◽  
Francesco Santoro
Keyword(s):  
Public Transport ◽  
Scheduling Problems ◽  
Shift Scheduling

scholarly journals Towards Unifying Scheduling and Location Problems: A Non-Stationary Hypercube Model

2021 ◽  
Vol 16 (04) ◽  
pp. 137-161
Author(s):  
Regiane Máximo Siqueira ◽  
Caio Vitor Beojone
Keyword(s):  
Discrete Event Simulation ◽  
Emergency Service ◽  
Discrete Event ◽  
Service Systems ◽  
Location Problems ◽  
Scheduling Problems ◽  
Shift Scheduling ◽  
Event Simulation ◽  
Proposed Model ◽  
Hypercube Model

Purpose – this paper aims to develop a non-stationary hypercube model capable of uniting the properties that models for both problems seek (location and shift-scheduling problems). Theoretical framework – We present the proposed model using a mixed discrete-continuous time Markov chain and compares it to a discrete-event simulation through an illustrative example. Design/methodology/approach – The method used in this paper is quantitative with a comparison between an approach of simulation and an exact model. Findings – The results show a high similarity between both models. However, the proposed model does not present noise in performance measures such as waiting times and travel times. Nevertheless, the study of their residuals revealed that the proposed model has a lower sensitivity to events, such as shift endings and imperfections in dispatch preferences. Further studies may reduce such a variation by improvements in the calculations of performance measurements. Research, Practical & Social implications – The mentioned results suggest that the proposed model may become an option for applications uniting location and shift-scheduling problems. Originality/value – When developing location problems, we seek models that are capable of representing the pertinent geographic characteristics to the problem. On the other hand, when developing shift-scheduling problems, we seek models capable of capturing transient fluctuations in the components (such as demand, service times, available workforce, among others) of such a system. Therefore, in the search to improve the daily operations of systems, such as emergency service systems (ambulances, police, firefighters) using either of the two problems individually, it may lead to flawed conclusions. Keywords - Emergency Service Systems; Queueing Theory; Hypercube non-stationary; Discrete Event Simulation; Performance Measurement.

Formal languages for integer programming modeling of shift scheduling problems

Constraints ◽  
2009 ◽  
Vol 16 (1) ◽  
pp. 54-76 ◽  
Author(s):  
Marie-Claude Côté ◽  
Bernard Gendron ◽  
Claude-Guy Quimper ◽  
Louis-Martin Rousseau
Keyword(s):  
Integer Programming ◽  
Formal Languages ◽  
Scheduling Problems ◽  
Shift Scheduling

Two-Operation Crane Scheduling Problems

1982 ◽  
Vol 14 (3) ◽  
pp. 147-155 ◽  
Author(s):  
R. W. Lieberman ◽  
I. B. Turksen
Keyword(s):  
Scheduling Problems ◽  
Crane Scheduling
Sign in / Sign up

Export Citation Format

Share Document