Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
From MaRDI portal
Publication:490241
Recommendations
- Scatter search based algorithms for min-max regret task scheduling problems with interval uncertainty
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
Cites work
- scientific article; zbMATH DE number 2144390 (Why is no real title available?)
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Complexity of the min-max and min-max regret assignment problems
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Exact and heuristic algorithms for the interval data robust assignment problem
- Graphs, networks and algorithms
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure
- On the approximability of robust spanning tree problems
- Robust discrete optimization and its applications
- Scatter search based algorithms for min-max regret task scheduling problems with interval uncertainty
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Scheduling
- Scheduling independent tasks to reduce mean finishing time
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Some aspects of scatter search in the flow-shop problem
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- The Theory of Statistical Decision
Cited in
(12)- The minmax regret permutation flow-shop problem with two jobs
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- Measures of problem uncertainty for scheduling with interval processing times
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Scatter search based algorithms for min-max regret task scheduling problems with interval uncertainty
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- Minimizing maximum cost for a single machine under uncertainty of processing times
This page was built for publication: Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490241)
