Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem
- 122 Downloads
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.
KeywordsScheduling theory Location theory Global optimization
Unable to display preview. Download preview PDF.
- Hamacher, H. W., & Hennes, H. (2007). Integrated scheduling and location models: single machine makespan problems. Studies in Locational Analysis, 16, 77–90. Google Scholar
- Hennes, H. (2005). Integration of scheduling and location models. Aachen: Shaker Verlag. Google Scholar
- Megiddo, N. (1984). Linear programming in linear time when the dimension is fixed. Journal of the Association for Computing Machinery, 31(1), 114–127. Google Scholar
- Minkowski, H. (1967). Gesammelte Abhandlungen—Band 2. New York: Chelsea Publishing Company. Google Scholar
- Mulmuley, K. (1994). Computational geometry: an introduction through randomized algorithms. Englewood Cliffs: Prentice Hall. Google Scholar
- Nickel, S., & Puerto, J. (2005). Location theory: a unified approach. Berlin: Springer. Google Scholar
- Puerto, J., & Fernández, F. R. (2000). Geometrical properties of the symmetrical single facility location problem. Journal of Nonlinear and Convex Analysis, 1(3), 321–342. Google Scholar
- Weißler, A. (1999). General bisectors and their application in planar location theory. Aachen: Shaker Verlag. Google Scholar