The following pages link to (Q4875178):
Displaying 22 items.
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
- Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework (Q666034) (← links)
- Resource scheduling with variable requirements over time (Q835625) (← links)
- Approximating earliest arrival flows with flow-dependent transit times (Q867858) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem (Q1001009) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- News from the online traveling repairman. (Q1401247) (← links)
- Off-line admission control for general scheduling problems (Q1592760) (← links)
- Scheduling space-sharing for internet advertising (Q1600000) (← links)
- The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Resource cost aware scheduling (Q1750475) (← links)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates (Q2294224) (← links)
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (Q2450684) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting (Q2798120) (← links)
- (Q3304142) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
