Scatter search based algorithms for min-max regret task scheduling problems with interval uncertainty
From MaRDI portal
Publication:5501010
zbMATH Open1318.93049MaRDI QIDQ5501010FDOQ5501010
Authors: Jozefczyk Jerzy, Marcin Siepak 
Publication date: 10 August 2015
Recommendations
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- Measures of problem uncertainty for scheduling with interval processing times
- A robust identical parallel machine scheduling model based on min-max regret criterion
Approximation methods and heuristics in mathematical programming (90C59) Minimax problems in mathematical programming (90C47) General methods in interval analysis (65G40) Control/observation systems with incomplete information (93C41)
Cited In (7)
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- A minmax regret approach to the critical path method with task interval times
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Worst-case relative regret algorithm for task allocation in complex operation system
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty
This page was built for publication: Scatter search based algorithms for min-max regret task scheduling problems with interval uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501010)
