Pages that link to "Item:Q2643723"

The following pages link to A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data (Q2643723):

Displaying 22 items.

• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
• Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
• Scheduling with uncertainties on new computing platforms (Q535305) (← links)
• Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
• Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← links)
• Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
• Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
• Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
• Distributionally robust single machine scheduling with risk aversion (Q1752194) (← links)
• Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
• Robust scheduling on a single machine to minimize total flow time (Q1762157) (← links)
• Flow-based formulations for operational fixed interval scheduling problems with random delays (Q1789616) (← links)
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
• Multi–stage process for chemotherapy scheduling and effective capacity determination (Q6056099) (← links)
• Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks (Q6109311) (← links)