A fixed job scheduling problem with machine-dependent job weights
From MaRDI portal
Recommendations
- Spread time considerations in operational fixed job scheduling
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
- Working time constraints in operational fixed job scheduling
- Interval scheduling on identical machines
- Scheduling on parallel machines considering job-machine dependency constraints
Cites work
- A Greedy On-Line Algorithm for thek-Track Assignment Problem
- A heuristic approach to the bus driver scheduling problem
- Approximation Algorithms for Fixed Job Schedule Problems
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Interval scheduling on identical machines
- On the approximability of an interval scheduling problem
- On the computational complexity of (maximum) class scheduling
- Scheduling jobs with fixed start and end times
- Spread time considerations in operational fixed job scheduling
- The Fixed Job Schedule Problem with Spread-Time Constraints
- Three scheduling algorithms applied to the Earth observing systems domain
Cited in
(4)- MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints
- Working time constraints in operational fixed job scheduling
- Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
- Tactical fixed job scheduling with spread-time constraints
This page was built for publication: A fixed job scheduling problem with machine-dependent job weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183761)
