Pages that link to "Item:Q1029565"
From MaRDI portal
The following pages link to Maximizing the minimum completion time on parallel machines (Q1029565):
Displaying 13 items.
- Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962) (← links)
- A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines (Q342416) (← links)
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← links)
- Optimizing busy time on parallel machines (Q476900) (← links)
- Dispatching-rule variants algorithms for used spaces of storage supports (Q782053) (← links)
- Minimizing the sum of job completion times on capacitated parallel machines (Q1339850) (← links)
- A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
- Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← links)
- Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
- Tight bounds for the identical parallel machine‐scheduling problem: Part II (Q3502134) (← links)
- (Q4411418) (← links)
