Heuristics for a Continuous Multi-facility Location Allocation Problem with Demand Regions

Date

2013-07-01

Author

Dinler, Derya
Tural, Mustafa Kemal
İyigün, Cem

Metadata

Show full item record

Item Usage Stats

46
views

0
downloads

URI

https://hdl.handle.net/11511/83798

Collections

Unverified, Conference / Seminar

Suggestions

OpenMETU
Core

Heuristics for a continuous multi-facility location problem with demand regions Dinler, Derya; Tural, Mustafa Kemal; İyigün, Cem; Department of Operational Research (2013) We consider a continuous multi-facility location problem where the demanding entities are regions in the plane instead of points. Each region may consist of a finite or an infinite number of points. The service point of a station can be anywhere in the region that is assigned to it. We do not allow fractional assignments, that is, each region is assigned to exactly one facility. The problem we consider can be stated as follows: given m demand regions in the plane, find the locations of q facilities and allo...
Heuristics for a continuous multi-facility location problem with demand regions Dinler, Derya; Tural, Mustafa Kemal; İyigün, Cem (Elsevier BV, 2015-10) We propose mathematical programming formulations of the single and multiple facility versions of the problem considered. The single facility location problem is formulated as a second order cone programming (SOCP) problem, and hence is solvable in polynomial time. The multiple facility location problem is NP-hard in general and can be formulated as a mixed integer SOCP problem. This formulation is weak and does not even solve medium-size instances. To solve larger instances of the problem we propose three h...
Heuristics for operational fixed job scheduling problems with working and spread time constraints Eliiyi, Deniz Tursel; Azizoğlu, Meral (Elsevier BV, 2011-07-01) Operational fixed job scheduling problems select a set of jobs having fixed ready and processing times and schedule the selected jobs on parallel machines so as to maximize the total weight. In this study, we consider working time and spread time constrained versions of the operational fixed job scheduling problems. The working time constraints limit the total processing load on each machine. The spread time constraints limit the time between the start of the first job and the finish of the last job on each...
Heuristic procedures for multi-item dynamic lot sizing problem with set-up times Uluöz, B Deniz; Kırca, Ömer; Department of Industrial Engineering (1988)
Heuristics for Dynamic Scheduling of Multi-Class Base-Stock Controlled Systems Kat, Bora; Avşar, Zeynep Müge (2005-05-20) Dynamic scheduling of an exponential single-server facility processing different types of items one by one is studied for the case of Poisson demand arrivals. Inventories of the items are managed by base-stock policies and backordering is allowed. Structure of the optimal scheduling policy is investigated numerically with respect to a weighted average of the fill rates. Performance of the optimal policy is compared to those of two well-known policies, Longest Queue and First-Come-First-Served, and alternati...

Citation Formats

D. Dinler, M. K. Tural, and C. İyigün, “Heuristics for a Continuous Multi-facility Location Allocation Problem with Demand Regions,” 2013, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/83798.