Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
DOI10.1007/S10479-014-1538-1zbMATH Open1303.90055DBLPjournals/anor/SiepakJ14OpenAlexW1993458850WikidataQ59399011 ScholiaQ59399011MaRDI QIDQ490241FDOQ490241
Authors: Marcin Siepak, Jerzy Józefczyk 
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1538-1
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
Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)
Cites Work
- The Theory of Statistical Decision
- Robust discrete optimization and its applications
- Title not available (Why is that?)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Scheduling
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Scheduling independent tasks to reduce mean finishing time
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Some aspects of scatter search in the flow-shop problem
- Graphs, networks and algorithms
- Complexity of the min-max and min-max regret assignment problems
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- Exact and heuristic algorithms for the interval data robust assignment problem
- 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
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- 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
- Title not available (Why is that?)
Cited In (7)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- The minmax regret permutation flow-shop problem with two jobs
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
Uses Software
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)
