Pages that link to "Item:Q342174"
From MaRDI portal
The following pages link to The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174):
Displaying 20 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)
- Optimality region for job permutation in single-machine scheduling with uncertain processing times (Q827990) (← links)
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← links)
- Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
- The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
- Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
- Robust scheduling on a single machine to minimize total flow time (Q1762157) (← links)
- Stochastic single machine scheduling problem as a multi-stage dynamic random decision process (Q2051165) (← links)
- Minimizing maximum cost for a single machine under uncertainty of processing times (Q2184134) (← links)
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients (Q2282559) (← links)
- Single machine scheduling problem with interval processing times and total completion time objective (Q2283853) (← links)
- Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
- Research on the vehicle routing problem with interval demands (Q2295076) (← links)
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data (Q2643723) (← links)
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times (Q2664350) (← links)
- Exact Algorithms for Distributionally <i>β</i>-Robust Machine Scheduling with Uncertain Processing Times (Q5137951) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
- Target-oriented robust satisficing models for the single machine scheduling problems with release time (Q6568456) (← links)