Robust absolute single machine makespan scheduling-location problem on trees

DOI10.1016/j.orl.2019.11.001OpenAlexW2987559581WikidataQ126830736 ScholiaQ126830736MaRDI QIDQ2294524

Sven O. Krumke, Huy Minh Le

Publication date: 11 February 2020

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

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

zbMATH Keywords

treeuncertaintyrobustnesslocation problemcenter problemscheduling problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (5)

Robust single machine makespan scheduling with release date uncertainty ⋮ Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem ⋮ An exact framework for the discrete parallel machine scheduling location problem ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem

Cites Work

• Solving scheduling and location problems in the plane simultaneously
• Algorithms for the robust 1-center problem on a tree
• Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
• Minmax-regret robust 1-median location on a tree
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Robust absolute single machine makespan scheduling-location problem on trees