A Multi-level Continuous Minimax Location Problem with Regional Demand

Date

2017-04-27

Author

Farıdyahyaeı, Amın
Tural, Mustafa Kemal
Duran, Serhan

Metadata

Show full item record

Item Usage Stats

26
views

0
downloads

URI

http://mme2017.cankaya.edu.tr/abstract-book/
https://hdl.handle.net/11511/82184

Collections

Unverified, Conference / Seminar

Suggestions

OpenMETU
Core

A Multi-level continuous minimax location problem with regional demand Faridyahyaei, Amin; Tural, Mustafa Kemal; Department of Industrial Engineering (2017) The minimax facility location problem seeks for the optimal locations of the facilities in the plane so that the maximum Euclidean distance between the demanding entities (given points in the plane) and their corresponding nearest facilities is minimized. In the solutions, remote entities (irrespective of their weights) tend to pull the facilities toward themselves which may result in larger distances for the other entities. In this thesis, we consider a multi-level minimax location problem which allows som...
A minisum location problem with regional demand considering farthest Euclidean distances DİNLER, DERYA; Tural, Mustafa Kemal (2016-06-01) We consider a continuous multi-facility location-allocation problem that aims to minimize the sum of weighted farthest Euclidean distances between (closed convex) polygonal and/or circular demand regions, and facilities they are assigned to. We show that the single facility version of the problem has a straightforward second-order cone programming formulation and can therefore be efficiently solved to optimality. To solve large size instances, we adapt a multi-dimensional direct search descent algorithm to ...
A fixed job scheduling problem with machine-dependent job weights Eliiyi, D. T.; Azizoğlu, Meral (2009-01-01) This study considers the identical parallel machines operational fixed job scheduling problem with machine-dependent job weights. A job is either processed in a fixed interval or is not processed at all. Our aim is to maximise the total weight of the processed jobs. We show that the problem with machine eligibility constraints resides as a special case of this problem. We identify some special polynomially solvable cases and propose a branch-and-bound (BB) algorithm that employs efficient bounding schemes a...
A Resource Constrained Project Scheduling Problem With Multi-Modes Altintas, Cansu; Azizoğlu, Meral (2020-01-01) In this study, the authors consider a project scheduling problem with a single non-renewable resource. The authors assume that the resource is released at scheduled times and specified quantities and the resource is consumed at activity completion. The activities can be processed at different modes where a mode is defined by a processing time and a resource requirement amount. The problem is to select the modes and timings of the activities so as to minimize the project completion time. The authors give a m...
A Flexible flowshop problem with total flowtime minimization Çakmak, Ergin; Kondakçı, Suna; Azizoğlu, Meral; Department of Industrial Engineering (1998)

Citation Formats

A. Farıdyahyaeı, M. K. Tural, and S. Duran, “A Multi-level Continuous Minimax Location Problem with Regional Demand,” 2017, Accessed: 00, 2021. [Online]. Available: http://mme2017.cankaya.edu.tr/abstract-book/.