Pages that link to "Item:Q1195868"
From MaRDI portal
The following pages link to On the complexity of scheduling tasks with discrete starting times (Q1195868):
Displaying 14 items.
- Algorithmic properties of ciliate sequence alignment (Q847670) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301) (← links)
- Single machine scheduling with forbidden start times (Q1022436) (← links)
- The counting complexity of a simple scheduling problem (Q1038110) (← links)
- Parts-to-picker based order processing in a rack-moving mobile robots environment (Q1683078) (← links)
- Balanced splitting on weighted intervals (Q1785388) (← links)
- On the approximability of an interval scheduling problem (Q1806343) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- Runway sequencing with holding patterns (Q2482798) (← links)
- Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment (Q2664445) (← links)
- Complexity of a class of task scheduling problems (Q2711272) (← 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)
