Pages that link to "Item:Q5458825"
From MaRDI portal
The following pages link to Order Scheduling Models: Hardness and Algorithms (Q5458825):
Displaying 16 items.
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← links)
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms (Q722523) (← links)
- An ordered independence system and its applications to scheduling problems (Q1330565) (← links)
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
- GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers (Q1639994) (← links)
- Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- On scheduling coflows (Q2211360) (← links)
- Scheduling fully parallel jobs (Q2317138) (← links)
- Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135) (← links)
- Scheduling Fully Parallel Jobs with Integer Parallel Units (Q2988818) (← links)
- (Q4605690) (← links)
- Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
- (Q5092350) (← links)
- Select and permute: an improved online framework for scheduling to minimize weighted completion time (Q5919414) (← links)