A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem
Year of publication: |
1 February 2019
|
---|---|
Authors: | Hernández-Leandro, Noberto A. ; Boyer, Vincent ; Salazar-Aguilar, M. Angélica ; Rousseau, Louis-Martin |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 272.2019, 3 (1.2.), p. 859-867
|
Subject: | Scheduling | Shift scheduling problem | Context-free grammar | Lagrangian relaxation | Matheuristic | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Personaleinsatzplanung | Crew scheduling |
-
An integer programming approach for the physician rostering problem
Wickert, Toni I., (2021)
-
The Multi-Period Workforce Scheduling and Routing Problem
Guastaroba, Gianfranco, (2021)
-
Integrated and sequential solution methods for the cyclic bus driver rostering problem
Er-Rbib, Safae, (2021)
- More ...
-
Flexible job-shop scheduling problem with resource recovery constraints
Devassia, Jobish Vallikavungal, (2018)
-
Multi-depot periodic vehicle routing problem with due dates and time windows
Cantu-Funes, Roberto, (2018)
-
The scale force sizing problem with multi-period workload assignments, and service time windows
Salazar-Aguilar, M. Angélica, (2019)
- More ...