Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
From MaRDI portal
Publication:2268516
DOI10.1007/s10951-008-0094-4zbMath1185.90071OpenAlexW2063102956MaRDI QIDQ2268516
Marcel T. Kalsch, Horst W. Hamacher, Donatas Elvikis
Publication date: 8 March 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0094-4
Related Items (10)
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 ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ Discrete parallel machine makespan ScheLoc problem ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Solving scheduling and location problems in the plane simultaneously ⋮ The big cube small cube solution method for multidimensional facility location problems ⋮ Robust absolute single machine makespan scheduling-location problem on trees ⋮ 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometrical properties of the Fermat-Weber problem
- Algorithmic results for ordered median problems
- A flexible approach to location problems
- Location Theory
- Some Properties of Location Problems with Block and Round Norms
- Using Block Norms for Location Modeling
- Linear Programming in Linear Time When the Dimension Is Fixed
- Efficient Planarity Testing
- Solving nonconvex planar location problems by finite dominating sets
This page was built for publication: Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
