NETWORK METHOD USING CONNECTING RATIO IN CONSTRUCTION SCHEDULING

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling in Container Terminals using Network Simplex Algorithm

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

متن کامل

A Heuristic using GOSST with 2 Connecting Strategies for Minimum Construction Cost of Network

The goal of this research is to devise a heuristic to solve the GOSST(Grade of Services Steiner Minimum Tree) problem that could apply to the design of communication networks. GOSST problem is to find a network topology satisfying the G-condition with minimum construction cost. The proposed heuristic might provide a way to design of more economical network offering differential grade of service...

متن کامل

Improving Spectrum Efficiency by Cognitive Radio Network Using Scheduling Method

Recent studies show that the fixed spectrum assignment policy enforced today results in poor spectrum utilization. To address this problem, the concept of cognitive radio is proposed to address the issue of spectrum efficiency and has been receiving an increasing attention in recent years, since it equips wireless users the capability to optimally adapt their operating parameters according to t...

متن کامل

scheduling in container terminals using network simplex algorithm

in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Architecture and Planning (Transactions of AIJ)

سال: 2001

ISSN: 1340-4210,1881-8161

DOI: 10.3130/aija.66.161_1