Pages that link to "Item:Q2448861"
From MaRDI portal
The following pages link to Minimizing total weighted completion time approximately for the parallel machine problem with a single server (Q2448861):
Displaying 11 items.
- Scheduling jobs with equal processing times and a single server on parallel identical machines (Q313819) (← links)
- Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization (Q342414) (← links)
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← links)
- WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines (Q459788) (← links)
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471) (← links)
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
- A PTAS for minimizing the total weighted completion time on identical parallel machines. (Q2757623) (← links)
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
- An approximation algorithm for parallel machine scheduling with a common server (Q4658402) (← 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)
