Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
From MaRDI portal
Recommendations
- Solving scheduling and location problems in the plane simultaneously
- Discrete parallel machine makespan ScheLoc problem
- scientific article; zbMATH DE number 2242479
- An exact framework for the discrete parallel machine scheduling location problem
- Integrated scheduling and location models: single machine makespan problems
Cites work
- scientific article; zbMATH DE number 410386 (Why is no real title available?)
- scientific article; zbMATH DE number 2242479 (Why is no real title available?)
- A flexible approach to location problems
- Algorithmic results for ordered median problems
- Efficient Planarity Testing
- Geometrical properties of the Fermat-Weber problem
- Geometrical properties of the symmetrical single facility location problem
- Integrated scheduling and location models: single machine makespan problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- Location theory. A unified approach
- Solving nonconvex planar location problems by finite dominating sets
- Some Properties of Location Problems with Block and Round Norms
- Using Block Norms for Location Modeling
Cited in
(16)- An exact framework for the discrete parallel machine scheduling location problem
- On the mass COVID-19 vaccination scheduling 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
- Location, scheduling, design and integer programming
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- The big cube small cube solution method for multidimensional facility location problems
- Scheduling-location problem with drones
- An integrated approach for allocation and scheduling-location problems on graphs
- Logic-based benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption
- Solving scheduling and location problems in the plane simultaneously
- Robust absolute single machine makespan scheduling-location problem on trees
- Integrated scheduling and location models: single machine makespan problems
- Discrete parallel machine makespan ScheLoc problem
- 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
- scientific article; zbMATH DE number 2242479 (Why is no real title available?)
This page was built for publication: Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268516)
