Multicommodity network flow model of a human resource allocation problem considering time periods
From MaRDI portal
(Redirected from Publication:6661228)
Recommendations
- Scheduling part-time personnel with availability restrictions and preferences to maximize employee satisfaction
- A class of manpower scheduling problems
- Shift scheduling with optimized service levels and employee satisfaction
- THE ASSIGNMENT OF INDIVIDUAL RENEWABLE RESOURCES IN SCHEDULING
- A mixed integer programming approach to multi-skilled workforce scheduling
Cites work
- A Multicommodity Flow Approach to the Crew Rostering Problem
- Airline crew rostering: problem types, modeling, and optimization
- Algorithms for multiplayer multicommodity flow problems
- An efficient solution approach for real-world driver scheduling problems in urban bus transportation
- An integer multicommodity flow model applied to the rerostering of nurse schedules
- An integer programming model for the weekly tour scheduling problem
- Competence-based assignment of tasks to workers in factories with demand-driven manufacturing
- Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
- Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering
- scientific article; zbMATH DE number 3744893 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Network flows. Theory, algorithms, and applications.
- Simultaneous disruption recovery of a train timetable and crew roster in real time
- Single workgroup scheduling problem with variable processing personnel
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
This page was built for publication: Multicommodity network flow model of a human resource allocation problem considering time periods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661228)