The following pages link to (Q4865763):
Displayed 10 items.
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645) (← links)
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system (Q954048) (← links)
- Identical parallel machine scheduling with time-dependent processing times (Q1704597) (← links)
- Makespan minimization subject to flowtime optimality on identical parallel machines (Q1885968) (← links)
- Makespan minimization for two parallel machines with an availability constraint (Q1887910) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
- Minimizing flowtime subject to optimal makespan on two identical parallel machines (Q5189089) (← links)
- Minimizing makespan subject to minimum flowtime on two identical parallel machines (Q5939974) (← links)