Modeling and algorithmic development of a staff scheduling problem
From MaRDI portal
Recommendations
Cites work
- A New Algorithm for the 0-1 Knapsack Problem
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An algorithm for a class of loading problems
- An Algorithm for Large Set Partitioning Problems
- An Analysis of Private and Public Sector Location Models
- An Application of Symbolic Logic to a Selection Problem
- Approximation algorithms for combinatorial problems
- scientific article; zbMATH DE number 3526435 (Why is no real title available?)
- scientific article; zbMATH DE number 3561085 (Why is no real title available?)
- scientific article; zbMATH DE number 3235858 (Why is no real title available?)
- Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
- Integer Programming: Methods, Uses, Computations
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning
- Optimal Political Districting by Implicit Enumeration Techniques
- The Loading Problem
- The Set-Partitioning Problem: Set Covering with Equality Constraints
- The truck dispatching problem
Cited in
(6)- Staff scheduling and rostering: a review of applications, methods and models.
- Modeling and solving staff scheduling with partial weighted maxSAT
- The venue management problem: setting staffing levels, shifts and shift schedules at concession stands
- Modeling staff scheduling problems. A tutorial
- A constraint programming-based solution approach for medical resident scheduling problems
- Heuristic algorithms for visiting the customers in a rolling schedule environment
This page was built for publication: Modeling and algorithmic development of a staff scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925863)