Modeling and algorithmic development of a staff scheduling problem
From MaRDI portal
Publication:5925863
DOI10.1016/S0377-2217(99)00421-XzbMath0996.90045OpenAlexW2058671006MaRDI QIDQ5925863
Sanjay Aggarwal, Sarin, Subhash C.
Publication date: 20 February 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00421-x
Related Items
Heuristic algorithms for visiting the customers in a rolling schedule environment ⋮ Staff scheduling and rostering: a review of applications, methods and models. ⋮ A constraint programming-based solution approach for medical resident scheduling problems ⋮ The venue management problem: setting staffing levels, shifts and shift schedules at concession stands
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for combinatorial problems
- The Truck Dispatching Problem
- A New Algorithm for the 0-1 Knapsack Problem
- An Algorithm for Large Set Partitioning Problems
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning
- An algorithm for a class of loading problems
- Integer Programming: Methods, Uses, Computations
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- The Set-Partitioning Problem: Set Covering with Equality Constraints
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Analysis of Private and Public Sector Location Models
- Optimal Political Districting by Implicit Enumeration Techniques
- An Application of Symbolic Logic to a Selection Problem
- The Loading Problem
- Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
This page was built for publication: Modeling and algorithmic development of a staff scheduling problem