Pages that link to "Item:Q3157317"
From MaRDI portal
The following pages link to Sequencing with uncertain numerical data for makespan minimisation (Q3157317):
Displayed 19 items.
- Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133) (← links)
- Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
- Group shops scheduling with makespan criterion subject to random release dates and processing times (Q733535) (← links)
- Stability polyhedra of optimal permutation of jobs servicing (Q893928) (← links)
- Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917) (← links)
- Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time (Q980257) (← links)
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness (Q1715728) (← links)
- Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
- Mean flow time minimization with given bounds of processing times (Q1887954) (← links)
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
- Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← links)
- Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← links)
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
- Uncertainty measure for the Bellman-Johnson problem with interval processing times (Q2452733) (← links)
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
- The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times (Q3111147) (← links)
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times (Q3163137) (← links)
- TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES (Q3406723) (← links)
- Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks (Q6109311) (← links)