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

DOI10.1016/J.ORL.2022.11.001OpenAlexW4308738222MaRDI QIDQ2102848FDOQ2102848

Authors: Sven O. Krumke, Huy Minh Le 

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

uncertaintyapproximation algorithmsrobust optimizationlatenessscheduling-location

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Approximation algorithms for NP-hard problems.
• Theory and applications of robust optimization
• Robust optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scheduling
• Scheduling algorithms
• Algorithms for the robust 1-center problem on a tree
• Some simple scheduling algorithms
• Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
• Integrated scheduling and location models: single machine makespan problems
• Title not available (Why is that?)
• Robust absolute single machine makespan scheduling-location problem on trees
• Robust single machine makespan scheduling with release date uncertainty

Cited In (1)

• An integrated approach for allocation and scheduling-location problems on graphs

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102848)