Minimal Resources for Fixed and Variable Job Schedules
From MaRDI portal
Cited in
(22)- Vehicles scheduling with sliding time windows
- On the computational complexity of (maximum) class scheduling
- License class design: Complexity and algorithms
- A graph colouring model for assigning a heterogeneous workforce to a given schedule
- Routing trains through railway stations: Complexity issues
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
- An approximation algorithm for the license and shift class design problem
- Maximizing the value of a space mission
- An analysis of shift class design problems
- Scheduling jobs within time windows on identical parallel machines: New model and algorithms
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- A dynamic programming based algorithm for the crew scheduling problem.
- Inverse interval scheduling via reduction on a single machine
- Stability and fairness in the job scheduling problem
- Optimal interval scheduling with a resource constraint
- Dynamic fleet scheduling with uncertain demand and customer flexibility
- Algorithms for large scale shift minimisation personnel task scheduling problems
- On the complexity of interval scheduling with a resource constraint
- Broadcasting revenue sharing after cancelling sports competitions
- On the computational complexity of (maximum) shift class scheduling
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
- Fixed interval scheduling: models, applications, computational complexity and algorithms
This page was built for publication: Minimal Resources for Fixed and Variable Job Schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4147822)
