Pages that link to "Item:Q4363763"
From MaRDI portal
The following pages link to Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem (Q4363763):
Displayed 8 items.
- Improving fleet utilization for carriers by interval scheduling (Q439488) (← links)
- Algorithms for large scale shift minimisation personnel task scheduling problems (Q439608) (← links)
- Personnel scheduling: models and complexity (Q541689) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Minimizing the number of machines for scheduling jobs with equal processing times (Q1042179) (← links)
- Minimizing the number of machines for minimum length schedules (Q1042210) (← links)
- On the approximability of an interval scheduling problem (Q1806343) (← links)
- Employee positioning and workload allocation (Q2384902) (← links)