A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem
From MaRDI portal
Publication:1991205
DOI10.1016/j.ejor.2018.07.010zbMath1403.90333OpenAlexW2885049275WikidataQ129440678 ScholiaQ129440678MaRDI QIDQ1991205
Publication date: 30 October 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.07.010
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Grammars and rewriting systems (68Q42) Theory of organizations, manpower planning in operations research (90B70)
Related Items (3)
Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems ⋮ A matheuristic algorithm for stochastic home health care planning ⋮ Learning to reduce state-expanded networks for multi-activity shift scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts
- A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
- A \texttt{cost-regular} based hybrid column generation approach
- A large neighbourhood search approach to the multi-activity shift scheduling problem
- A Lagrangian-based heuristic for large-scale set covering problems
- Formal languages for integer programming modeling of shift scheduling problems
- Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Heuristic Method for the Set Covering Problem
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
This page was built for publication: A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem
