Pages that link to "Item:Q490241"
From MaRDI portal
The following pages link to Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241):
Displaying 10 items.
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- Minimizing maximum cost for a single machine under uncertainty of processing times (Q2184134) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← links)
- Complexity of minimizing the total flow time with interval data and minmax regret criterion (Q2433804) (← links)
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
- The minmax regret permutation flow-shop problem with two jobs (Q2572850) (← links)