A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
We consider a personalized employee scheduling problem with characteristics present in retail stores consisting of multiple departments. In the setting under study, each department generally covers its demand in employees over the planning horizon of a week by assigning shifts to its own staff. Howe...
Guardado en:
Autores principales: | Dalia Attia, Reinhard Bürgy, Guy Desaulniers, François Soumis |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2019
|
Materias: | |
Acceso en línea: | https://doaj.org/article/cec71d8ac0fa4315b597c5df966cf960 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Integration of routing into a resource-constrained project scheduling problem
por: Philippe Lacomme, et al.
Publicado: (2019) -
A robust basic cyclic scheduling problem
por: Idir Hamaz, et al.
Publicado: (2018) -
Improved integral simplex using decomposition for the set partitioning problem
por: Abdelouahab Zaghrouti, et al.
Publicado: (2018) -
CP methods for scheduling and routing with time-dependent task costs
por: Elena Kelareva, et al.
Publicado: (2014) -
Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers
por: Jens Poppenborg, et al.
Publicado: (2016)