Single machine scheduling problems with uncertain parameters and the OWA criterion

DOI10.1007/s10951-015-0444-yzbMath1341.90048arXiv1405.5371OpenAlexW1930081464WikidataQ59472686 ScholiaQ59472686MaRDI QIDQ282249

Adam Kasperski, Paweł Zieliński

Publication date: 12 May 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.5371

zbMATH Keywords

schedulingsingle machinerobust optimizationOWA criterion

Mathematics Subject Classification ID

Related Items (9)

Investigating the recoverable robust single machine scheduling problem under interval uncertainty ⋮ Bin packing problem with scenarios ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Parameterized multi-scenario single-machine scheduling problems ⋮ Minimizing worst-case and average-case makespan over scenarios ⋮ Risk Averse Scheduling with Scenarios ⋮ An approximation scheme for the bi-scenario sum of completion times trade-off problem ⋮ Risk-averse single machine scheduling: complexity and approximation ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the number of late jobs on a single machine under due date uncertainty
• On the robust single machine scheduling problem
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Improved polynomial algorithms for robust bottleneck problems with interval data
• Computing improved optimal solutions to max-min flexible constraint satisfaction problems
• On approximation algorithms for the minimum satisfiability problem
• Robust discrete optimization and its applications
• Exact algorithms for OWA-optimization in multiobjective spanning tree problems
• On solving linear programs with the ordered weighted averaging objective.
• Approximating the min-max (regret) selecting items problem
• Single machine scheduling with scenarios
• A family of inequalities valid for the robust single machine scheduling polyhedron
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• An algorithm for the single machine sequencing problem with precedence constraints
• Complexity of Scheduling under Precedence Constraints
• The Minimum Satisfiability Problem
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• On the complexity of a class of combinatorial optimization problems with uncertainty

This page was built for publication: Single machine scheduling problems with uncertain parameters and the OWA criterion