Pages that link to "Item:Q2085744"
From MaRDI portal
The following pages link to Weighted completion time minimization for capacitated parallel machines (Q2085744):
Displaying 12 items.
- WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines (Q459788) (← links)
- A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems (Q1310018) (← links)
- Minimizing the sum of job completion times on capacitated parallel machines (Q1339850) (← links)
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
- Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines (Q2883611) (← links)
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
- (Q4782744) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution (Q5146966) (← links)
- Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel (Q5438523) (← links)
- Weighted completion time minimization for capacitated parallel machines (Q6366633) (← links)
- A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines (Q6588490) (← links)
