Solving scheduling and location problems in the plane simultaneously

Authors:
Marcel T. Kalsch;Zvi Drezner
Affiliations:
Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany,;College of Business and Economics, California State University-Fullerton, Fullerton, CA 92834, USA
Venue:
Computers and Operations Research
Year:
2010

Citing 6
Cited 0

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems

Operations Research
A General Global Optimization Approach for Solving Location Problems in the Plane

Journal of Global Optimization
Handbook on Scheduling: Models and Methods for Advanced Planning (International Handbooks on Information Systems)

Handbook on Scheduling: Models and Methods for Advanced Planning (International Handbooks on Information Systems)
Scheduling Algorithms

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

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we concentrate on the simultaneous single machine scheduling-location (ScheLoc) model in the plane. The model combines both the location of the machine and the scheduling of the jobs executed by the machine. Two objectives are analyzed: the makespan and the total completion time. Basic properties of the models are shown and lower bounds on the value of the objective functions are developed. Single machine ScheLoc problems with Euclidean, rectilinear and general @?"q norms are solved very efficiently by the ''big triangle small triangle'' branch-and-bound approach. Randomly generated problems with 10,000 jobs are solved in about 5-10min within a relative accuracy of @e=10^-^5 from the global optimum.