The following pages link to Interval scheduling: A survey (Q3524590):
Displaying 25 items.
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores (Q2835690) (← links)
- Online Optimization of Busy Time on Parallel Machines (Q2898056) (← links)
- Algorithmic Analysis for Ridesharing of Personal Vehicles (Q2958336) (← links)
- Working time constraints in operational fixed job scheduling (Q3163130) (← links)
- A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem (Q3452768) (← links)
- Improved Randomized Results for That Interval Selection Problem (Q3541101) (← links)
- No-Wait Scheduling for Locks (Q5139604) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- A classification scheme for integrated staff rostering and scheduling problems (Q5247703) (← links)
- Exploring a Resolution Method Based on an Evolutionary Game-Theoretical Model for Minimizing the Machines with Limited Workload Capacity and Interval Constraints (Q5357764) (← links)
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. (Q6058197) (← links)
- Fixed interval scheduling with third‐party machines (Q6065340) (← links)
- Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models (Q6106505) (← links)
- A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
- A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
- Mobility offer allocations in corporate settings (Q6114908) (← links)
- A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes (Q6551145) (← links)
- Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades (Q6554626) (← links)
- On the parameterized complexity of interval scheduling with eligible machine sets (Q6564614) (← links)
- Any-order online interval selection (Q6574946) (← links)
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms (Q6611071) (← links)
- New partitioning techniques and faster algorithms for approximate interval scheduling (Q6614114) (← links)
- Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs (Q6648269) (← links)
