Pages that link to "Item:Q1885968"
From MaRDI portal
The following pages link to Makespan minimization subject to flowtime optimality on identical parallel machines (Q1885968):
Displaying 12 items.
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system (Q954048) (← links)
- Minimizing makespan subject to minimum total flow-time on identical parallel machines (Q1580983) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines (Q3156679) (← links)
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions (Q3192848) (← links)
- On the Minimization of the Makespan Subject to Flowtime Optimality (Q4272903) (← links)
- Minimizing makespan in parallel flowshops (Q4356676) (← links)
- Minimizing flowtime subject to optimal makespan on two identical parallel machines (Q5189089) (← links)
- Bicriteria multi-machine scheduling with equal processing times subject to release dates (Q6145328) (← links)
