Robust absolute single machine makespan scheduling-location problem on trees

DOI10.1016/J.ORL.2019.11.001MaRDI QIDQ2294524zbMATH OpenOpenAlexWikidataFDO

Authors 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

center problemlocation problemrobustnessscheduling problemtreeuncertainty

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
• Robust single machine makespan scheduling with release date uncertainty
• On the robust single machine scheduling problem
• Single machine robust scheduling with budgeted uncertainty
• Algorithms and complexity analysis for robust single-machine scheduling problems

Cites work

• Algorithms for the robust 1-center problem on a tree
• scientific article; zbMATH DE number 2242479 (Why is no real title available?)
• Integrated scheduling and location models: single machine makespan problems
• Minmax-regret robust 1-median location on a tree
• Robust optimization
• Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
• Solving scheduling and location problems in the plane simultaneously
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

Cited in

(11)

• 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
• Robust single machine makespan scheduling with release date uncertainty
• 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
• Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
• Scheduling-location problem with drones
• An integrated approach for allocation and scheduling-location problems on graphs
• Robust reverse 1-center problems on trees with interval costs
• Single-machine makespan scheduling with scenario-dependent release dates
• Combinatorial algorithms for the minmax robust median subtree problem on tree networks with interval vertex weights
• The minmax regret scheduling-location problem on trees with interval-data edge lengths

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

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