The following pages link to (Q3798207):
Displaying 15 items.
- Scheduling stochastic jobs with due dates on parallel machines (Q750283) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Scheduling semi-malleable jobs to minimize mean flow time (Q892832) (← links)
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
- Minimizing expected makespans of multi-priority classes of jobs on uniform processors (Q1180830) (← links)
- Scheduling stochastic jobs with increasing hazard rate on identical parallel machines (Q1206392) (← links)
- A note on Lehtonen's schedule on parallel processors (Q1326506) (← links)
- Stochastic scheduling on parallel machines to minimize discounted holding costs (Q2268513) (← links)
- The ``least flexible job first'' rule in scheduling and in queueing (Q2450742) (← links)
- Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures (Q2629648) (← links)
- Scheduling independent tasks to minimize the makespan on identical machines (Q2805367) (← links)
- Stochastically minimizing the makespan in flow shops (Q3220336) (← links)
- The “Largest Variance First” Policy in Some Stochastic Scheduling Problems (Q3786262) (← links)
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors (Q3827790) (← links)
- (Q4715987) (← links)