Displaying similar documents to “Optimal Distribution Centers Involving Supply Capacity, Demands and Budget Restriction”

Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem

Maric, Miroslav (2013)

Serdica Journal of Computing

Similarity:

In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results...

A new schedule generation scheme for resource-constrained project scheduling

Cyril Briand (2009)

RAIRO - Operations Research

Similarity:

In this paper, a new schedule generation scheme for resource-constrained project scheduling problems is proposed. Given a project scheduling problem and a priority rule, a schedule generation scheme determines a single feasible solution by inserting one by one each activity, according to their priority, inside a partial schedule. The paper proposes a generation scheme that differs from the classic ones in the fact that it allows to consider the activities in any order, whether their...

A discrete-time approximation technique for the time-cost trade-off in PERT networks

Amir Azaron, Masatoshi Sakawa, Reza Tavakkoli-Moghaddam, Nima Safaei (2007)

RAIRO - Operations Research

Similarity:


We develop a discrete-time approximation technique dealing with the time-cost trade-off problem in PERT networks. It is assumed that the activity durations are independent random variables with generalized Erlang distributions, in which the mean duration of each activity is a non-increasing function of the amount of resource allocated to it. It is also assumed that the amount of resource allocated to each activity is controllable. Then, we construct an optimal control problem with...

On the conjecture relating minimax and minimean complexity norms

Peter Růžička, Juraj Wiedermann (1979)

Aplikace matematiky

Similarity:

Using counterexample it has been shown that an algorithm which is minimax optimal and over all minimax optimal algorithms is minimean optimal and has a uniform behaviour need not to be minimean optimal.