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

Technical Report, Reports in Wirtschaftsmathematik, Number 106, Technische Universität Kaiserslautern, Available at http://kluedo.ub.uni-kl.de/volltexte/2007/2062/, Februrary, 2007

Authors

• Donatas Elvikis
• Horst W. Hamacher
• Marcel Kalsch

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 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.

BibTeX

 
@TechReport{ ElvikisEtAl:ScheLoc, 
   title = { Scheduling and Location (ScheLoc): Makespan Problem with Variable Release Dates }, 
   author = { Donatas Elvikis and Horst W. Hamacher and Marcel Kalsch },     
   series = { Reports in Wirtschaftsmathematik },  
   number = { 106 }, 
   institution = { Technische Universität Kaiserslautern },       
   note = { Available at http://kluedo.ub.uni-kl.de/volltexte/2007/2062/ }, 
   month = feb, 
   year = 2007, 
} 

---

This publication belongs to the project DeNDeMA.