Pages that link to "Item:Q2165594"
From MaRDI portal
The following pages link to Exact makespan minimization of unrelated parallel machines (Q2165594):
Displaying 7 items.
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647) (← links)
- Minimizing makespan subject to minimum total flow-time on identical parallel machines (Q1580983) (← links)
- Discrete parallel machine makespan ScheLoc problem (Q1679512) (← links)
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848) (← links)
- Makespan minimization subject to flowtime optimality on identical parallel machines (Q1885968) (← links)
- An efficient approximation algorithm for minimizing makespan on uniformly related machines. (Q2775886) (← links)
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions (Q3192848) (← links)