Pages that link to "Item:Q1296376"
From MaRDI portal
The following pages link to Bounds for the position of the smallest job in completion time variance minimization (Q1296376):
Displaying 15 items.
- A lower bound for weighted completion time variance (Q613431) (← links)
- Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
- Job scheduling methods for reducing waiting time variance (Q878584) (← links)
- A tight lower bound for the completion time variance problem (Q1268251) (← links)
- \(V\)-shape property for job sequences that minimize the expected completion time variance (Q1278193) (← links)
- A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← links)
- On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
- Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
- A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
- An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests (Q2583511) (← links)
- Sequencing heuristic for bicriteria scheduling in a single machine problem (Q3411893) (← links)
- Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)
