Min-max relative regret for scheduling to minimize maximum lateness

DOI10.1007/978-3-031-34347-6_5MaRDI QIDQ6182890

Imad Assayakh, Imed Kacem, Giorgio Lucarelli

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

schedulinginterval uncertaintymaximum latenessmin-max relative regret

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Robust combinatorial optimization under convex and discrete cost uncertainty
• On the robust single machine scheduling problem
• Algorithms and complexity analysis for robust single-machine scheduling problems
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Computing and minimizing the relative regret in combinatorial optimization with interval data
• Robust discrete optimization and its applications
• Minmax regret solutions for minimax optimization problems with uncertainty
• Complexity results for common due date scheduling problems with interval data and minmax regret criterion
• 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
• The minmax regret permutation flow-shop problem with two jobs
• Some simple scheduling algorithms
• Programming with linear fractional functionals
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Min-max relative regret for scheduling to minimize maximum lateness