Until very recently, DNA has been considered just as primary storage of instructions for the makeup of living organisms. Over a decade ago, (Adleman, 1994) gave the successful demonstration of a DNA’s potential use for different purposes, more specifically, a solution to the Hamiltonian Path Problem (HPP), a problem considered beyond reach for feasible solution on conventional computers. A comp...

An activity network is an acyclic graph with non-negative weights and with a unique source and destination. A project consisting of a set of activities and precedence relationships can be represented by an activity network and the mathematical analysis of the network provides useful information for managing the project. In a traditional activity network, it is assumed that an activity always be...

in this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. in this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. in other words, there is a dictated ready date as well as a d...

Smooth implementation and controlling conflicting goals of a project with the usage of all related resources through organization is inherently a complex task to management. At the same time deterministic models are never efficient in practical project management (PM) decision problems because the related parameters are frequently fuzzy in nature. The project execution time is a major concern o...

Correct scheduling of the project is the necessary condition for the project success. In traditional models, the activities duration times are deterministic and known. In real world however, accurate calculation of time for performing each activity is not possible and is always faced with uncertainty. In this paper, the duration of each activity is estimated by the experts as linguistic variabl...

critical path method (cpm) is one of the most popular techniques used by construction practitioners for construction project scheduling since the 1950s. despite its popularity, cpm has a major shortcoming, as it is schedule based on two impractical acceptance that the project deadline is not bounded and that resources are unlimited. the analytical competency and computing capability of cpm thus...

The maximum mean weight cycle problem is well-known: given a digraph G with weights 9 c :E(G) → R, 3nd a directed circuit in G whose mean weight is maximum. Closely related is the minimum balance problem: Find a potential :V (G) → R such that the numbers 11 slack(e):= (w)− (v)− c((v; w)) (e= (v; w)∈E(G)) are optimally balanced: for any subset of vertices, the minimum slack on an entering edge s...