Pages that link to "Item:Q5470732"
From MaRDI portal
The following pages link to Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems (Q5470732):
Displaying 15 items.
- The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
- Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- Scheduling MapReduce jobs on identical and unrelated processors (Q778521) (← links)
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
- Scheduling under the network of temporo-spatial proximity relationships (Q1652320) (← links)
- Approximation algorithms for simple assembly line balancing problems (Q2125223) (← links)
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates (Q2294224) (← links)
- Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions (Q3163694) (← links)
- Approximation Algorithms for Scheduling with Resource and Precedence Constraints (Q3304123) (← links)
- Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
- (Q5092350) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds (Q5232862) (← links)
- Some complexity results and an efficient algorithm for quay crane scheduling problem (Q5298341) (← links)
