2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem

DOI10.1016/J.ORL.2022.11.001OpenAlexW4308738222MaRDI QIDQ2102848

Huy Minh Le, Sven O. Krumke

Publication date: 12 December 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.11.001

zbMATH Keywords

uncertaintylatenessrobust optimizationapproximation algorithmsscheduling-location

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Algorithms for the robust 1-center problem on a tree
• Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
• Robust absolute single machine makespan scheduling-location problem on trees
• Robust single machine makespan scheduling with release date uncertainty
• Theory and Applications of Robust Optimization
• Some simple scheduling algorithms
• Scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem