Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion

DOI10.1007/s10479-014-1538-1zbMath1303.90055OpenAlexW1993458850WikidataQ59399011 ScholiaQ59399011MaRDI QIDQ490241

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

zbMATH Keywords

minmax regretapproximation algorithmsinterval uncertaintytask schedulingscatter search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items (4)

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 ⋮ Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates

Uses Software

• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure
• Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
• On the approximability of robust spanning tree problems
• Exact and heuristic algorithms for the interval data robust assignment problem
• Complexity of the min-max and min-max regret assignment problems
• Graphs, networks and algorithms
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• 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
• Improved polynomial algorithms for robust bottleneck problems with interval data
• Robust discrete optimization and its applications
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
• Some aspects of scatter search in the flow-shop problem
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Scheduling independent tasks to reduce mean finishing time
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• The Theory of Statistical Decision
• Scheduling

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