Solving scheduling and location problems in the plane simultaneously

DOI10.1016/j.cor.2009.04.014zbMath1177.90165OpenAlexW2061515285MaRDI QIDQ732883

Marcel T. Kalsch, Zvi Drezner

Publication date: 15 October 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.014

zbMATH Keywords

global optimizationlocation theoryscheduling theory

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (9)

A note on equity across groups in facility location ⋮ 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 ⋮ The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Robust absolute single machine makespan scheduling-location problem on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general global optimization approach for solving location problems in the plane
• Locating lines and hyperplanes. Theory and algorithms
• An extended multifacility minimax location problem revisited
• Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
• The weighted minimax location problem with set-up costs and extensions
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• Two algorithms for constructing a Delaunay triangulation
• A Trajectory Method for the Optimization of the Multi-Facility Location Problem With lp Distances
• Single Facility $l_p $-Distance Minimax Location
• On the Set of Optimal Points to the Weber Problem
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• Modelling Inter-city Road Distances by Mathematical Functions
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Location Theory, Dominance, and Convexity
• Handbook on Scheduling
• Gauge distances and median hyperplanes

This page was built for publication: Solving scheduling and location problems in the plane simultaneously