Pages that link to "Item:Q3319772"
From MaRDI portal
The following pages link to Complexity results for scheduling tasks with discrete starting times (Q3319772):
Displaying 14 items.
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Single machine scheduling with forbidden start times (Q1022436) (← links)
- On the complexity of scheduling tasks with discrete starting times (Q1195868) (← links)
- Efficient order processing in an inverse order picking system (Q1651533) (← links)
- Parts-to-picker based order processing in a rack-moving mobile robots environment (Q1683078) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Balanced splitting on weighted intervals (Q1785388) (← links)
- On the approximability of an interval scheduling problem (Q1806343) (← links)
- Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space (Q2197157) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards (Q2362173) (← links)
- Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment (Q2664445) (← links)
- Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores (Q2835690) (← links)
- Approximate search for known gene clusters in new genomes using PQ-trees (Q6487618) (← links)
