Comment on Berman and Huang (2004): Minisum collection depots location problem reduces to the p-median problem

Ozpeynirci, O.
Süral, Haldun


Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria
Ozlen, M.; Azizoğlu, Meral (Informa UK Limited, 2011-01-01)
In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and the schedule deviation measures. The efficiency measure is the total flow time, and the schedule deviation measure is the total disruption cost caused by the differences between the initial and current schedules. We provide polynomial-time solution methods to the follo...
On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
Denizel, M; Süral, Haldun (Informa UK Limited, 2006-04-01)
We address the multi-item, capacitated lot-sizing problem (CLSP) encountered in environments where demand is dynamic and to be met on time. Items compete for a limited capacity resource, which requires a setup for each lot of items to be produced causing unproductive time but no direct costs. The problem belongs to a class of problems that are difficult to solve. Even the feasibility problem becomes combinatorial when setup times are considered. This difficulty in reaching optimality and the practical relev...
Simulation of capacity expansion and sequencing alternatives for a sheet metal producer
Arer, MM; Özdemirel, Nur Evin (Informa UK Limited, 1999-06-01)
We present a simulation case study carried out for a make-to-order aluminium sheet producer located in Istanbul, Turkey. We are concerned with a subsystem of the factory consisting of continuous casting, cold rolling, and annealing processes. Two simulation models are developed: (1) a combined model for studying the casting process only; (2) a discrete event model for comparing capacity expansion alternatives and order sequencing rules in the subsystem. Operational characteristics of the real system and pas...
Enhanced adjacent extreme-point search and tabu search for the minimum concave-cost uncapacitated transshipment problem
Bazlamaçcı, Cüneyt Fehmi (Informa UK Limited, 1996-09-01)
Practicable methods for optimising concave-cast, uncapacitated transshipment networks are non exact. In this paper, one such effective method, that of adjacent extreme point search, is further developed to enhance its overall computational efficiency. The enhanced search algorithm is then imbedded in a tabu search scheme which proved capable of finding better solutions, by a wide margin in some instances. Another tabu search scheme, somewhat inferior in terms of solution quality but computationally more eff...
Linear programming based approaches for the discrete time/cost trade-off problem in project networks
Hafizoglu, A. B.; Azizoğlu, Meral (Informa UK Limited, 2010-04-01)
In project management, the activity durations can often be reduced by dedicating additional resources. The Time/Cost Trade-off Problem considers the compromise between the total cost and the project duration. The discrete version of the problem assumes a number of time/cost pairs, called modes, and selects a mode for each activity. In this paper, we consider the Discrete Time/Cost Trade-off Problem. We study the Deadline Problem, that is, the problem of minimizing total cost subject to a deadline on the pro...
Citation Formats
O. Ozpeynirci and H. Süral, “Comment on Berman and Huang (2004): Minisum collection depots location problem reduces to the p-median problem,” JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, pp. 1395–1396, 2007, Accessed: 00, 2020. [Online]. Available: