Pages that link to "Item:Q859906"
From MaRDI portal
The following pages link to Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906):
Displayed 13 items.
- Interval scheduling on related machines (Q547142) (← links)
- On the complexity of interval scheduling with a resource constraint (Q551193) (← links)
- Scheduling preparation of doses for a chemotherapy service (Q601167) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- Improved randomized results for the interval selection problem (Q986549) (← links)
- Multi-agent scheduling on a single machine with max-form criteria (Q2470117) (← links)
- DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM (Q3052722) (← links)
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm (Q3055658) (← links)
- Working time constraints in operational fixed job scheduling (Q3163130) (← links)
- A fixed job scheduling problem with machine-dependent job weights (Q3183761) (← links)
- Improved Randomized Results for That Interval Selection Problem (Q3541101) (← links)
- A Novel Approximate Algorithm for Admission Control (Q5321723) (← links)