Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem

Authors:
Donatas Elvikis;Horst W. Hamacher;Marcel T. Kalsch
Affiliations:
Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany;Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany;Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany
Venue:
Journal of Scheduling
Year:
2009

Citing 4
Cited 3

Efficient Planarity Testing

Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
Solving Nonconvex Planar Location Problems by Finite Dominating Sets

Journal of Global Optimization
Algorithmic results for ordered median problems

Operations Research Letters

The big cube small cube solution method for multidimensional facility location problems

Computers and Operations Research
Solving scheduling and location problems in the plane simultaneously

Computers and Operations Research
Book Reviews

Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

While in classical scheduling theory the locations of machines are assumed to be fixed we will show how to tackle location and scheduling problems simultaneously. Obviously, this integrated approach enhances the modeling power of scheduling for various real-life problems. In this paper, we introduce in an exemplary way theory and three polynomial solution algorithms for the planar ScheLoc makespan problem, which includes a specific type of a scheduling and a rather general, planar location problem, respectively. Finally, a report on numerical tests as well as a generalization of this specific ScheLoc problem is presented.