Pages that link to "Item:Q1319043"
From MaRDI portal
The following pages link to The \(k\)-track assignment problem (Q1319043):
Displaying 16 items.
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- On the online track assignment problem (Q423916) (← links)
- Interval scheduling maximizing minimum coverage (Q528573) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Scheduling jobs with fixed start and end times (Q1098765) (← links)
- Algorithmic analysis for ridesharing of personal vehicles (Q1630989) (← links)
- Note on scheduling intervals on-line (Q1805461) (← links)
- Interval scheduling with economies of scale (Q2108158) (← links)
- The \(k\)-Track assignment problem on partial orders (Q2464438) (← links)
- Optimal scheduling with nested time intervals and three-dimensional strip packing on comparability graphs of an arborescence order (Q2829147) (← links)
- Algorithmic Analysis for Ridesharing of Personal Vehicles (Q2958336) (← links)
- DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM (Q3052722) (← links)
- Interval scheduling: A survey (Q3524590) (← links)
- A Greedy On-Line Algorithm for thek-Track Assignment Problem (Q4240132) (← links)
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms (Q6611071) (← links)