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.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Donatas Elvikis, Horst W. Hamacher, Marcel T. Kalsch
URN (permanent link):urn:nbn:de:hbz:386-kluedo-14781
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (106)
Document Type:Preprint
Language of publication:English
Year of Completion:2007
Year of Publication:2007
Publishing Institute:Technische Universität Kaiserslautern
Tag:Algorithmics ; Gauge Distances; Location Theory ; Machine Scheduling
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik

$Rev: 12793 $