Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Carrizosa, E., Hamacher, H. W., Klein, R., & Nickel, S. (2000). Solving nonconvex planar location problems by finite dominating sets. Journal of Global Optimization, 18(2), 195–210.

    Article  Google Scholar 

  • Durier, R., & Michelot, C. (1985). Geometrical properties of the Fermat–Weber problem. European Journal of Operational Research, 20, 332–343.

    Article  Google Scholar 

  • 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 

  • Hopcroft, J., & Tarjan, R. (1974). Efficient planarity testing. Journal of the ACM, 21(4), 549–568.

    Article  Google Scholar 

  • Kalcsics, J., Nickel, S., Puerto, J., & Tamir, A. (2002). Algorithmic results for ordered median problems. Operations Research Letters, 30, 149–158.

    Article  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 

  • Rodríguez-Chía, A. M., Nickel, S., Puerto, J., & Fernández, F. R. (2000). A flexible approach to location problems. Mathematical Methods of Operations Research, 51(1), 69–89.

    Article  Google Scholar 

  • Thisse, J. F., Ward, J. E., & Wendell, R. E. (1984). Some properties of location problems with block and round norms. Operations Research, 32, 1309–1327.

    Article  Google Scholar 

  • Ward, J. E., & Wendell, R. E. (1985). Using block norms for location modeling. Operations Research, 33, 1074–1090.

    Article  Google Scholar 

  • Weißler, A. (1999). General bisectors and their application in planar location theory. Aachen: Shaker Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany

    Donatas Elvikis, Horst W. Hamacher & Marcel T. Kalsch

Authors
  1. Donatas Elvikis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Horst W. Hamacher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcel T. Kalsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Horst W. Hamacher.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Elvikis, D., Hamacher, H.W. & Kalsch, M.T. Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem. J Sched 12, 361–374 (2009). https://doi.org/10.1007/s10951-008-0094-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-008-0094-4

Keywords

Search

Navigation