## Scheduling and Location (ScheLoc): Makespan Problem with Variable Release Dates

• 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 present in an exemplary way theory and a solution algorithm for a specific type of a scheduling and a rather general, planar location problem, respectively. More general results and a report on numerical tests will be presented in a subsequent paper.

Author: Donatas Elvikis, Horst W. Hamacher, Marcel T. Kalsch urn:nbn:de:hbz:386-kluedo-14781 Report in Wirtschaftsmathematik (WIMA Report) (106) Preprint English 2007 2007 Technische Universität Kaiserslautern Algorithmics ; Gauge Distances; Location Theory ; Machine Scheduling Fachbereich Mathematik 510 Mathematik

$Rev: 12793$