Robust absolute single machine makespan scheduling-location problem on trees
From MaRDI portal
Publication:2294524
DOI10.1016/J.ORL.2019.11.001OpenAlexW2987559581WikidataQ126830736 ScholiaQ126830736MaRDI QIDQ2294524FDOQ2294524
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
Cites Work
- Title not available (Why is that?)
- Minmax-regret robust 1-median location on a tree
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Algorithms for the robust 1-center problem on a tree
- Solving scheduling and location problems in the plane simultaneously
- 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?)
Cited In (8)
- 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
- Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and 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
- Scheduling-location problem with drones
- Robust reverse 1-center problems on trees with interval costs
- An integrated approach for allocation and scheduling-location problems on graphs
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)
