CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: buffer allocation problem</title> <meta name="description" content="Search results for: buffer allocation problem"> <meta name="keywords" content="buffer allocation problem"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="buffer allocation problem" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="buffer allocation problem"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 8047</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: buffer allocation problem</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8047</span> A Petri Net Model to Obtain the Throughput of Unreliable Production Lines in the Buffer Allocation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Joselito%20Medina-Marin">Joselito Medina-Marin</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexandr%20Karelin"> Alexandr Karelin</a>, <a href="https://publications.waset.org/abstracts/search?q=Ana%20Tarasenko"> Ana Tarasenko</a>, <a href="https://publications.waset.org/abstracts/search?q=Juan%20Carlos%20Seck-Tuoh-Mora"> Juan Carlos Seck-Tuoh-Mora</a>, <a href="https://publications.waset.org/abstracts/search?q=Norberto%20Hernandez-Romero"> Norberto Hernandez-Romero</a>, <a href="https://publications.waset.org/abstracts/search?q=Eva%20Selene%20Hernandez-Gress"> Eva Selene Hernandez-Gress</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A production line designer faces with several challenges in manufacturing system design. One of them is the assignment of buffer slots in between every machine of the production line in order to maximize the throughput of the whole line, which is known as the Buffer Allocation Problem (BAP). The BAP is a combinatorial problem that depends on the number of machines and the total number of slots to be distributed on the production line. In this paper, we are proposing a Petri Net (PN) Model to obtain the throughput in unreliable production lines, based on PN mathematical tools and the decomposition method. The results obtained by this methodology are similar to those presented in previous works, and the number of machines is not a hard restriction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem" title="buffer allocation problem">buffer allocation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Petri%20Nets" title=" Petri Nets"> Petri Nets</a>, <a href="https://publications.waset.org/abstracts/search?q=throughput" title=" throughput"> throughput</a>, <a href="https://publications.waset.org/abstracts/search?q=production%20lines" title=" production lines"> production lines</a> </p> <a href="https://publications.waset.org/abstracts/79811/a-petri-net-model-to-obtain-the-throughput-of-unreliable-production-lines-in-the-buffer-allocation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79811.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">307</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8046</span> Buffer Allocation and Traffic Shaping Policies Implemented in Routers Based on a New Adaptive Intelligent Multi Agent Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Taheri%20Tehrani">M. Taheri Tehrani</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Ajorloo"> H. Ajorloo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, an intelligent multi-agent framework is developed for each router in which agents have two vital functionalities, traffic shaping and buffer allocation and are positioned in the ports of the routers. With traffic shaping functionality agents shape the traffic forward by dynamic and real time allocation of the rate of generation of tokens in a Token Bucket algorithm and with buffer allocation functionality agents share their buffer capacity between each other based on their need and the conditions of the network. This dynamic and intelligent framework gives this opportunity to some ports to work better under burst and more busy conditions. These agents work intelligently based on Reinforcement Learning (RL) algorithm and will consider effective parameters in their decision process. As RL have limitation considering much parameter in its decision process due to the volume of calculations, we utilize our novel method which invokes Principle Component Analysis (PCA) on the RL and gives a high dimensional ability to this algorithm to consider as much as needed parameters in its decision process. This implementation when is compared to our previous work where traffic shaping was done without any sharing and dynamic allocation of buffer size for each port, the lower packet drop in the whole network specifically in the source routers can be seen. These methods are implemented in our previous proposed intelligent simulation environment to be able to compare better the performance metrics. The results obtained from this simulation environment show an efficient and dynamic utilization of resources in terms of bandwidth and buffer capacities pre allocated to each port. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=principal%20component%20analysis" title="principal component analysis">principal component analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=reinforcement%20learning" title=" reinforcement learning"> reinforcement learning</a>, <a href="https://publications.waset.org/abstracts/search?q=buffer%20allocation" title=" buffer allocation"> buffer allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-%20agent%20systems" title=" multi- agent systems"> multi- agent systems</a> </p> <a href="https://publications.waset.org/abstracts/26050/buffer-allocation-and-traffic-shaping-policies-implemented-in-routers-based-on-a-new-adaptive-intelligent-multi-agent-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26050.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">518</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8045</span> Customer Experience Management in Food and Beverage Outlet at Indian School of Business: Methodology and Recommendations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anupam%20Purwar">Anupam Purwar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In conventional consumer product industry, stockouts are taken care by carrying buffer stock to check underserving caused by changes in customer demand, incorrect forecast or variability in lead times. But, for food outlets, the alternate of carrying buffer stock is unviable because of indispensable need to serve freshly cooked meals. Besides, the food outlet being the sole provider has no incentives to reduce stockouts, as they have no fear of losing revenue, gross profit, customers and market share. Hence, innovative, easy to implement and practical ways of addressing the twin problem of long queues and poor customer experience needs to be investigated. Current work analyses the demand pattern of 11 different food items across a routine day. Based on this optimum resource allocation for all food items has been carried out by solving a linear programming problem with cost minimization as the objective. Concurrently, recommendations have been devised to address this demand and supply side problem keeping in mind their practicability. Currently, the recommendations are being discussed and implemented at ISB (Indian School of Business) Hyderabad campus. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=F%26B%20industry" title="F&B industry">F&B industry</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=demand%20management" title=" demand management"> demand management</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming"> linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=LP" title=" LP"> LP</a>, <a href="https://publications.waset.org/abstracts/search?q=queuing%20analysis" title=" queuing analysis"> queuing analysis</a> </p> <a href="https://publications.waset.org/abstracts/102394/customer-experience-management-in-food-and-beverage-outlet-at-indian-school-of-business-methodology-and-recommendations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102394.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">138</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8044</span> An Improved VM Allocation Algorithm by Utilizing Combined Resource Allocation Mechanism and Released Resources in Cloud Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Md%20Habibul%20Ansary">Md Habibul Ansary</a>, <a href="https://publications.waset.org/abstracts/search?q=Chandan%20Garai"> Chandan Garai</a>, <a href="https://publications.waset.org/abstracts/search?q=Ranjan%20Dasgupta"> Ranjan Dasgupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Utilization of resources is always a great challenge for any allocation problem, particularly when resource availability is dynamic in nature. In this work VM allocation mechanism has been augmented by providing resources in a combined manner. This approach has some inherent advantages in terms of reduction of wait state for the pending jobs of some users and better utilization of unused resources from the service providers’ point of view. Moreover the algorithm takes care of released resources from the finished jobs as soon as those become available. The proposed algorithm has been explained by suitable example to make the work complete. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bid%20ratio" title="Bid ratio">Bid ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20service" title=" cloud service"> cloud service</a>, <a href="https://publications.waset.org/abstracts/search?q=virtualization" title=" virtualization"> virtualization</a>, <a href="https://publications.waset.org/abstracts/search?q=VM%20allocation%20problem" title=" VM allocation problem"> VM allocation problem</a> </p> <a href="https://publications.waset.org/abstracts/34024/an-improved-vm-allocation-algorithm-by-utilizing-combined-resource-allocation-mechanism-and-released-resources-in-cloud-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34024.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">396</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8043</span> Design of a Phemt Buffer Amplifier in Mm-Wave Band around 60 GHz</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maryam%20Abata">Maryam Abata</a>, <a href="https://publications.waset.org/abstracts/search?q=Moulhime%20El%20Bekkali"> Moulhime El Bekkali</a>, <a href="https://publications.waset.org/abstracts/search?q=Said%20Mazer"> Said Mazer</a>, <a href="https://publications.waset.org/abstracts/search?q=Catherine%20Algani"> Catherine Algani</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahmoud%20Mehdi"> Mahmoud Mehdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One major problem of most electronic systems operating in the millimeter wave band is the signal generation with a high purity and a stable carrier frequency. This problem is overcome by using the combination of a signal with a low frequency local oscillator (LO) and several stages of frequency multipliers. The use of these frequency multipliers to create millimeter-wave signals is an attractive alternative to direct generation signal. Therefore, the isolation problem of the local oscillator from the other stages is always present, which leads to have various mechanisms that can disturb the oscillator performance, thus a buffer amplifier is often included in oscillator outputs. In this paper, we present the study and design of a buffer amplifier in the mm-wave band using a 0.15μm pHEMT from UMS foundry. This amplifier will be used as a part of a frequency quadrupler at 60 GHz. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mm-wave%20band" title="Mm-wave band">Mm-wave band</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20oscillator" title=" local oscillator"> local oscillator</a>, <a href="https://publications.waset.org/abstracts/search?q=frequency%20quadrupler" title=" frequency quadrupler"> frequency quadrupler</a>, <a href="https://publications.waset.org/abstracts/search?q=buffer%20amplifier" title=" buffer amplifier"> buffer amplifier</a> </p> <a href="https://publications.waset.org/abstracts/26079/design-of-a-phemt-buffer-amplifier-in-mm-wave-band-around-60-ghz" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26079.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">545</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8042</span> Multi Objective Simultaneous Assembly Line Balancing and Buffer Sizing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saif%20Ullah">Saif Ullah</a>, <a href="https://publications.waset.org/abstracts/search?q=Guan%20Zailin"> Guan Zailin</a>, <a href="https://publications.waset.org/abstracts/search?q=Xu%20Xianhao"> Xu Xianhao</a>, <a href="https://publications.waset.org/abstracts/search?q=He%20Zongdong"> He Zongdong</a>, <a href="https://publications.waset.org/abstracts/search?q=Wang%20Baoxi"> Wang Baoxi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Assembly line balancing problem is aimed to divide the tasks among the stations in assembly lines and optimize some objectives. In assembly lines the workload on stations is different from each other due to different tasks times and the difference in workloads between stations can cause blockage or starvation in some stations in assembly lines. Buffers are used to store the semi-finished parts between the stations and can help to smooth the assembly production. The assembly line balancing and buffer sizing problem can affect the throughput of the assembly lines. Assembly line balancing and buffer sizing problems have been studied separately in literature and due to their collective contribution in throughput rate of assembly lines, balancing and buffer sizing problem are desired to study simultaneously and therefore they are considered concurrently in current research. Current research is aimed to maximize throughput, minimize total size of buffers in assembly line and minimize workload variations in assembly line simultaneously. A multi objective optimization objective is designed which can give better Pareto solutions from the Pareto front and a simple example problem is solved for assembly line balancing and buffer sizing simultaneously. Current research is significant for assembly line balancing research and it can be significant to introduce optimization approaches which can optimize current multi objective problem in future. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=assembly%20line%20balancing" title="assembly line balancing">assembly line balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=buffer%20sizing" title=" buffer sizing"> buffer sizing</a>, <a href="https://publications.waset.org/abstracts/search?q=Pareto%20solutions" title=" Pareto solutions "> Pareto solutions </a> </p> <a href="https://publications.waset.org/abstracts/14084/multi-objective-simultaneous-assembly-line-balancing-and-buffer-sizing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14084.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">491</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8041</span> Mathematical Model and Algorithm for the Berth and Yard Resource Allocation at Seaports</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ming%20Liu">Ming Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhihui%20Sun"> Zhihui Sun</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaoning%20Zhang"> Xiaoning Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studies a deterministic container transportation problem, jointly optimizing the berth allocation, quay crane assignment and yard storage allocation at container ports. The problem is formulated as an integer program to coordinate the decisions. Because of the large scale, it is then transformed into a set partitioning formulation, and a framework of branchand- price algorithm is provided to solve it. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=branch-and-price" title="branch-and-price">branch-and-price</a>, <a href="https://publications.waset.org/abstracts/search?q=container%20terminal" title=" container terminal"> container terminal</a>, <a href="https://publications.waset.org/abstracts/search?q=joint%20scheduling" title=" joint scheduling"> joint scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=maritime%20logistics" title=" maritime logistics"> maritime logistics</a> </p> <a href="https://publications.waset.org/abstracts/69918/mathematical-model-and-algorithm-for-the-berth-and-yard-resource-allocation-at-seaports" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69918.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">293</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8040</span> An Efficient Subcarrier Scheduling Algorithm for Downlink OFDMA-Based Wireless Broadband Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hassen%20Hamouda">Hassen Hamouda</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Ouwais%20Kabaou"> Mohamed Ouwais Kabaou</a>, <a href="https://publications.waset.org/abstracts/search?q=Med%20Salim%20Bouhlel"> Med Salim Bouhlel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The growth of wireless technology made opportunistic scheduling a widespread theme in recent research. Providing high system throughput without reducing fairness allocation is becoming a very challenging task. A suitable policy for resource allocation among users is of crucial importance. This study focuses on scheduling multiple streaming flows on the downlink of a WiMAX system based on orthogonal frequency division multiple access (OFDMA). In this paper, we take the first step in formulating and analyzing this problem scrupulously. As a result, we proposed a new scheduling scheme based on Round Robin (RR) Algorithm. Because of its non-opportunistic process, RR does not take in account radio conditions and consequently it affect both system throughput and multi-users diversity. Our contribution called MORRA (Modified Round Robin Opportunistic Algorithm) consists to propose a solution to this issue. MORRA not only exploits the concept of opportunistic scheduler but also takes into account other parameters in the allocation process. The first parameter is called courtesy coefficient (CC) and the second is called Buffer Occupancy (BO). Performance evaluation shows that this well-balanced scheme outperforms both RR and MaxSNR schedulers and demonstrate that choosing between system throughput and fairness is not required. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=OFDMA" title="OFDMA">OFDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=opportunistic%20scheduling" title=" opportunistic scheduling"> opportunistic scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=fairness%20hierarchy" title=" fairness hierarchy"> fairness hierarchy</a>, <a href="https://publications.waset.org/abstracts/search?q=courtesy%20coefficient" title=" courtesy coefficient"> courtesy coefficient</a>, <a href="https://publications.waset.org/abstracts/search?q=buffer%20occupancy" title=" buffer occupancy"> buffer occupancy</a> </p> <a href="https://publications.waset.org/abstracts/59645/an-efficient-subcarrier-scheduling-algorithm-for-downlink-ofdma-based-wireless-broadband-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59645.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">300</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8039</span> A Novel Meta-Heuristic Algorithm Based on Cloud Theory for Redundancy Allocation Problem under Realistic Condition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Mousavi">H. Mousavi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Sharifi"> M. Sharifi</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Pourvaziri"> H. Pourvaziri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Redundancy Allocation Problem (RAP) is a well-known mathematical problem for modeling series-parallel systems. It is a combinatorial optimization problem which focuses on determining an optimal assignment of components in a system design. In this paper, to be more practical, we have considered the problem of redundancy allocation of series system with interval valued reliability of components. Therefore, during the search process, the reliabilities of the components are considered as a stochastic variable with a lower and upper bounds. In order to optimize the problem, we proposed a simulated annealing based on cloud theory (CBSAA). Also, the Monte Carlo simulation (MCS) is embedded to the CBSAA to handle the random variable components’ reliability. This novel approach has been investigated by numerical examples and the experimental results have shown that the CBSAA combining MCS is an efficient tool to solve the RAP of systems with interval-valued component reliabilities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=redundancy%20allocation%20problem" title="redundancy allocation problem">redundancy allocation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20theory" title=" cloud theory"> cloud theory</a>, <a href="https://publications.waset.org/abstracts/search?q=monte%20carlo%20simulation" title=" monte carlo simulation"> monte carlo simulation</a> </p> <a href="https://publications.waset.org/abstracts/33681/a-novel-meta-heuristic-algorithm-based-on-cloud-theory-for-redundancy-allocation-problem-under-realistic-condition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33681.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">412</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8038</span> A Fuzzy Multiobjective Model for Bed Allocation Optimized by Artificial Bee Colony Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jalal%20Abdulkareem%20Sultan">Jalal Abdulkareem Sultan</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdulhakeem%20Luqman%20Hasan"> Abdulhakeem Luqman Hasan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the development of health care systems competition, hospitals face more and more pressures. Meanwhile, resource allocation has a vital effect on achieving competitive advantages in hospitals. Selecting the appropriate number of beds is one of the most important sections in hospital management. However, in real situation, bed allocation selection is a multiple objective problem about different items with vagueness and randomness of the data. It is very complex. Hence, research about bed allocation problem is relatively scarce under considering multiple departments, nursing hours, and stochastic information about arrival and service of patients. In this paper, we develop a fuzzy multiobjective bed allocation model for overcoming uncertainty and multiple departments. Fuzzy objectives and weights are simultaneously applied to help the managers to select the suitable beds about different departments. The proposed model is solved by using Artificial Bee Colony (ABC), which is a very effective algorithm. The paper describes an application of the model, dealing with a public hospital in Iraq. The results related that fuzzy multi-objective model was presented suitable framework for bed allocation and optimum use. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bed%20allocation%20problem" title="bed allocation problem">bed allocation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20logic" title=" fuzzy logic"> fuzzy logic</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20bee%20colony" title=" artificial bee colony"> artificial bee colony</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a> </p> <a href="https://publications.waset.org/abstracts/45374/a-fuzzy-multiobjective-model-for-bed-allocation-optimized-by-artificial-bee-colony-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45374.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">324</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8037</span> Multi-Objective Optimization of Combined System Reliability and Redundancy Allocation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vijaya%20K.%20Srivastava">Vijaya K. Srivastava</a>, <a href="https://publications.waset.org/abstracts/search?q=Davide%20Spinello"> Davide Spinello</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents established 3<strong><sup>n</sup></strong> enumeration procedure for mixed integer optimization problems for solving multi-objective reliability and redundancy allocation problem subject to design constraints. The formulated problem is to find the optimum level of unit reliability and the number of units for each subsystem. A number of illustrative examples are provided and compared to indicate the application of the superiority of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title="integer programming">integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20programming" title=" mixed integer programming"> mixed integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Reliability%20Redundancy%20Allocation" title=" Reliability Redundancy Allocation"> Reliability Redundancy Allocation</a> </p> <a href="https://publications.waset.org/abstracts/107208/multi-objective-optimization-of-combined-system-reliability-and-redundancy-allocation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/107208.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">172</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8036</span> A Virtual Grid Based Energy Efficient Data Gathering Scheme for Heterogeneous Sensor Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Siddhartha%20Chauhan">Siddhartha Chauhan</a>, <a href="https://publications.waset.org/abstracts/search?q=Nitin%20Kumar%20Kotania"> Nitin Kumar Kotania</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traditional Wireless Sensor Networks (WSNs) generally use static sinks to collect data from the sensor nodes via multiple forwarding. Therefore, network suffers with some problems like long message relay time, bottle neck problem which reduces the performance of the network. Many approaches have been proposed to prevent this problem with the help of mobile sink to collect the data from the sensor nodes, but these approaches still suffer from the buffer overflow problem due to limited memory size of sensor nodes. This paper proposes an energy efficient scheme for data gathering which overcomes the buffer overflow problem. The proposed scheme creates virtual grid structure of heterogeneous nodes. Scheme has been designed for sensor nodes having variable sensing rate. Every node finds out its buffer overflow time and on the basis of this cluster heads are elected. A controlled traversing approach is used by the proposed scheme in order to transmit data to sink. The effectiveness of the proposed scheme is verified by simulation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=buffer%20overflow%20problem" title="buffer overflow problem">buffer overflow problem</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20sink" title=" mobile sink"> mobile sink</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20grid" title=" virtual grid"> virtual grid</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title=" wireless sensor networks"> wireless sensor networks</a> </p> <a href="https://publications.waset.org/abstracts/11672/a-virtual-grid-based-energy-efficient-data-gathering-scheme-for-heterogeneous-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11672.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">391</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8035</span> Understanding the Nature of Capital Allocation Problem in Corporate Finance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Meltem%20Gurunlu">Meltem Gurunlu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the central problems in corporate finance is the allocation of funds. This usually takes two forms: allocation of funds across firms in an economy or allocation of funds across projects or business units within a firm. The first one is typically related to the external markets (the bond market, the stock market, banks and finance companies) whereas the second form of the capital allocation is related to the internal capital markets in which corporate headquarters allocate capital to their business units. (within-group transfers, within-group credit markets, and within-group equity market). The main aim of this study is to investigate the nature of capital allocation dynamics by comparing the relevant studies carried out on external and internal capital markets with paying special significance to the business groups. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=internal%20capital%20markets" title="internal capital markets">internal capital markets</a>, <a href="https://publications.waset.org/abstracts/search?q=external%20capital%20markets" title=" external capital markets"> external capital markets</a>, <a href="https://publications.waset.org/abstracts/search?q=capital%20structure" title=" capital structure"> capital structure</a>, <a href="https://publications.waset.org/abstracts/search?q=capital%20allocation" title=" capital allocation"> capital allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=business%20groups" title=" business groups"> business groups</a>, <a href="https://publications.waset.org/abstracts/search?q=corporate%20finance" title=" corporate finance"> corporate finance</a> </p> <a href="https://publications.waset.org/abstracts/89423/understanding-the-nature-of-capital-allocation-problem-in-corporate-finance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89423.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">195</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8034</span> Exploring SSD Suitable Allocation Schemes Incompliance with Workload Patterns</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jae%20Young%20Park">Jae Young Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Hwansu%20Jung"> Hwansu Jung</a>, <a href="https://publications.waset.org/abstracts/search?q=Jong%20Tae%20Kim"> Jong Tae Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Whether the data has been well parallelized is an important factor in the Solid-State-Drive (SSD) performance. SSD parallelization is affected by allocation scheme and it is directly connected to SSD performance. There are dynamic allocation and static allocation in representative allocation schemes. Dynamic allocation is more adaptive in exploiting write operation parallelism, while static allocation is better in read operation parallelism. Therefore, it is hard to select the appropriate allocation scheme when the workload is mixed read and write operations. We simulated conditions on a few mixed data patterns and analyzed the results to help the right choice for better performance. As the results, if data arrival interval is long enough prior operations to be finished and continuous read intensive data environment static allocation is more suitable. Dynamic allocation performs the best on write performance and random data patterns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20allocation" title="dynamic allocation">dynamic allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=NAND%20flash%20based%20SSD" title=" NAND flash based SSD"> NAND flash based SSD</a>, <a href="https://publications.waset.org/abstracts/search?q=SSD%20parallelism" title=" SSD parallelism"> SSD parallelism</a>, <a href="https://publications.waset.org/abstracts/search?q=static%20allocation" title=" static allocation"> static allocation</a> </p> <a href="https://publications.waset.org/abstracts/41931/exploring-ssd-suitable-allocation-schemes-incompliance-with-workload-patterns" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41931.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">339</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8033</span> Definition and Core Components of the Role-Partner Allocation Problem in Collaborative Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Andrade-Garda">J. Andrade-Garda</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Anguera"> A. Anguera</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20Ares-Casal"> J. Ares-Casal</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Hidalgo-Lorenzo"> M. Hidalgo-Lorenzo</a>, <a href="https://publications.waset.org/abstracts/search?q=J.-A.%20Lara"> J.-A. Lara</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Lizcano"> D. Lizcano</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Su%C3%A1rez-Garaboa"> S. Suárez-Garaboa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the current constantly changing economic context, collaborative networks allow partners to undertake projects that would not be possible if attempted by them individually. These projects usually involve the performance of a group of tasks (named roles) that have to be distributed among the partners. Thus, an allocation/matching problem arises that will be referred to as Role-Partner Allocation problem. In real life this situation is addressed by negotiation between partners in order to reach <em>ad hoc</em> agreements. Besides taking a long time and being hard work, both historical evidence and economic analysis show that such approach is not recommended. Instead, the allocation process should be automated by means of a centralized matching scheme. However, as a preliminary step to start the search for such a matching mechanism (or even the development of a new one), the problem and its core components must be specified. To this end, this paper establishes (i) the definition of the problem and its constraints, (ii) the key features of the involved elements (i.e., roles and partners); and (iii) how to create preference lists both for roles and partners. Only this way it will be possible to conduct subsequent methodological research on the solution method.      <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=collaborative%20network" title="collaborative network">collaborative network</a>, <a href="https://publications.waset.org/abstracts/search?q=matching" title=" matching"> matching</a>, <a href="https://publications.waset.org/abstracts/search?q=partner" title=" partner"> partner</a>, <a href="https://publications.waset.org/abstracts/search?q=preference%20list" title=" preference list"> preference list</a>, <a href="https://publications.waset.org/abstracts/search?q=role" title=" role"> role</a> </p> <a href="https://publications.waset.org/abstracts/80311/definition-and-core-components-of-the-role-partner-allocation-problem-in-collaborative-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80311.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">235</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8032</span> Reliability and Cost Focused Optimization Approach for a Communication Satellite Payload Redundancy Allocation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mehmet%20Nefes">Mehmet Nefes</a>, <a href="https://publications.waset.org/abstracts/search?q=Selman%20Demirel"> Selman Demirel</a>, <a href="https://publications.waset.org/abstracts/search?q=Hasan%20H.%20Ertok"> Hasan H. Ertok</a>, <a href="https://publications.waset.org/abstracts/search?q=Cenk%20Sen"> Cenk Sen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A typical reliability engineering problem regarding communication satellites has been considered to determine redundancy allocation scheme of power amplifiers within payload transponder module, whose dominant function is to amplify power levels of the received signals from the Earth, through maximizing reliability against mass, power, and other technical limitations. Adding each redundant power amplifier component increases not only reliability but also hardware, testing, and launch cost of a satellite. This study investigates a multi-objective approach used in order to solve Redundancy Allocation Problem (RAP) for a communication satellite payload transponder, focusing on design cost due to redundancy and reliability factors. The main purpose is to find the optimum power amplifier redundancy configuration satisfying reliability and capacity thresholds simultaneously instead of analyzing respectively or independently. A mathematical model and calculation approach are instituted including objective function definitions, and then, the problem is solved analytically with different input parameters in MATLAB environment. Example results showed that payload capacity and failure rate of power amplifiers have remarkable effects on the solution and also processing time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=communication%20satellite%20payload" title="communication satellite payload">communication satellite payload</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=redundancy%20allocation%20problem" title=" redundancy allocation problem"> redundancy allocation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability" title=" reliability"> reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=transponder" title=" transponder"> transponder</a> </p> <a href="https://publications.waset.org/abstracts/86236/reliability-and-cost-focused-optimization-approach-for-a-communication-satellite-payload-redundancy-allocation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86236.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">261</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8031</span> Power Allocation Algorithm for Orthogonal Frequency Division Multiplexing Based Cognitive Radio Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bircan%20Demiral">Bircan Demiral</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cognitive radio (CR) is the promising technology that addresses the spectrum scarcity problem for future wireless communications. Orthogonal Frequency Division Multiplexing (OFDM) technology provides more power band ratios for cognitive radio networks (CRNs). While CR is a solution to the spectrum scarcity, it also brings up the capacity problem. In this paper, a novel power allocation algorithm that aims at maximizing the sum capacity in the OFDM based cognitive radio networks is proposed. Proposed allocation algorithm is based on the previously developed water-filling algorithm. To reduce the computational complexity calculating in water filling algorithm, proposed algorithm allocates the total power according to each subcarrier. The power allocated to the subcarriers increases sum capacity. To see this increase, Matlab program was used, and the proposed power allocation was compared with average power allocation, water filling and general power allocation algorithms. The water filling algorithm performed worse than the proposed algorithm while it performed better than the other two algorithms. The proposed algorithm is better than other algorithms in terms of capacity increase. In addition the effect of the change in the number of subcarriers on capacity was discussed. Simulation results show that the increase in the number of subcarrier increases the capacity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cognitive%20radio%20network" title="cognitive radio network">cognitive radio network</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDM" title=" OFDM"> OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20allocation" title=" power allocation"> power allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=water%20filling" title=" water filling"> water filling</a> </p> <a href="https://publications.waset.org/abstracts/92207/power-allocation-algorithm-for-orthogonal-frequency-division-multiplexing-based-cognitive-radio-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92207.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">137</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8030</span> Heuristic Methods for the Capacitated Location- Allocation Problem with Stochastic Demand</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salinee%20Thumronglaohapun">Salinee Thumronglaohapun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The proper number and appropriate locations of service centers can save cost, raise revenue and gain more satisfaction from customers. Establishing service centers is high-cost and difficult to relocate. In long-term planning periods, several factors may affect the service. One of the most critical factors is uncertain demand of customers. The opened service centers need to be capable of serving customers and making a profit although the demand in each period is changed. In this work, the capacitated location-allocation problem with stochastic demand is considered. A mathematical model is formulated to determine suitable locations of service centers and their allocation to maximize total profit for multiple planning periods. Two heuristic methods, a local search and genetic algorithm, are used to solve this problem. For the local search, five different chances to choose each type of moves are applied. For the genetic algorithm, three different replacement strategies are considered. The results of applying each method to solve numerical examples are compared. Both methods reach to the same best found solution in most examples but the genetic algorithm provides better solutions in some cases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=location-allocation%20problem" title="location-allocation problem">location-allocation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20demand" title=" stochastic demand"> stochastic demand</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/114723/heuristic-methods-for-the-capacitated-location-allocation-problem-with-stochastic-demand" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/114723.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">124</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8029</span> Network Coding with Buffer Scheme in Multicast for Broadband Wireless Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gunasekaran%20Raja">Gunasekaran Raja</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramkumar%20Jayaraman"> Ramkumar Jayaraman</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajakumar%20Arul"> Rajakumar Arul</a>, <a href="https://publications.waset.org/abstracts/search?q=Kottilingam%20Kottursamy"> Kottilingam Kottursamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Broadband Wireless Network (BWN) is the promising technology nowadays due to the increased number of smartphones. Buffering scheme using network coding considers the reliability and proper degree distribution in Worldwide interoperability for Microwave Access (WiMAX) multi-hop network. Using network coding, a secure way of transmission is performed which helps in improving throughput and reduces the packet loss in the multicast network. At the outset, improved network coding is proposed in multicast wireless mesh network. Considering the problem of performance overhead, degree distribution makes a decision while performing buffer in the encoding / decoding process. Consequently, BuS (Buffer Scheme) based on network coding is proposed in the multi-hop network. Here the encoding process introduces buffer for temporary storage to transmit packets with proper degree distribution. The simulation results depend on the number of packets received in the encoding/decoding with proper degree distribution using buffering scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=encoding%20and%20decoding" title="encoding and decoding">encoding and decoding</a>, <a href="https://publications.waset.org/abstracts/search?q=buffer" title=" buffer"> buffer</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20coding" title=" network coding"> network coding</a>, <a href="https://publications.waset.org/abstracts/search?q=degree%20distribution" title=" degree distribution"> degree distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=broadband%20wireless%20networks" title=" broadband wireless networks"> broadband wireless networks</a>, <a href="https://publications.waset.org/abstracts/search?q=multicast" title=" multicast"> multicast</a> </p> <a href="https://publications.waset.org/abstracts/48856/network-coding-with-buffer-scheme-in-multicast-for-broadband-wireless-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48856.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">410</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8028</span> The Lexicographic Serial Rule</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thi%20Thao%20Nguyen">Thi Thao Nguyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Andrew%20McLennan"> Andrew McLennan</a>, <a href="https://publications.waset.org/abstracts/search?q=Shino%20Takayama"> Shino Takayama</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study the probabilistic allocation of finitely many indivisible objects to finitely many agents. Well known allocation rules for this problem include random priority, the market mechanism proposed by Hylland and Zeckhauser [1979], and the probabilistic serial rule of Bogomolnaia and Moulin [2001]. We propose a new allocation rule, which we call the lexico-graphic (serial) rule, that is tailored for situations in which each agent's primary concern is to maximize the probability of receiving her favourite object. Three axioms, lex efficiency, lex envy freeness and fairness, are proposed and fully characterize the lexicographic serial rule. We also discuss how our axioms and the lexicographic rule are related to other allocation rules, particularly the probabilistic serial rule. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Efficiency" title="Efficiency">Efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=Envy%20free" title=" Envy free"> Envy free</a>, <a href="https://publications.waset.org/abstracts/search?q=Lexicographic" title=" Lexicographic"> Lexicographic</a>, <a href="https://publications.waset.org/abstracts/search?q=Probabilistic%20Serial%20Rule" title=" Probabilistic Serial Rule"> Probabilistic Serial Rule</a> </p> <a href="https://publications.waset.org/abstracts/124573/the-lexicographic-serial-rule" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/124573.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">148</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8027</span> Capacitated Multiple Allocation P-Hub Median Problem on a Cluster Based Network under Congestion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=%C3%87a%C4%9Fr%C4%B1%20%C3%96zg%C3%BCn%20Kibiro%C4%9Flu">Çağrı Özgün Kibiroğlu</a>, <a href="https://publications.waset.org/abstracts/search?q=Zeynep%20Turgut"> Zeynep Turgut</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers a hub location problem where the network service area partitioned into predetermined zones (represented by node clusters is given) and potential hub nodes capacity levels are determined a priori as a selection criteria of hub to investigate congestion effect on network. The objective is to design hub network by determining all required hub locations in the node clusters and also allocate non-hub nodes to hubs such that the total cost including transportation cost, opening cost of hubs and penalty cost for exceed of capacity level at hubs is minimized. A mixed integer linear programming model is developed introducing additional constraints to the traditional model of capacitated multiple allocation hub location problem and empirically tested. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hub%20location%20problem" title="hub location problem">hub location problem</a>, <a href="https://publications.waset.org/abstracts/search?q=p-hub%20median%20problem" title=" p-hub median problem"> p-hub median problem</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=congestion" title=" congestion"> congestion</a> </p> <a href="https://publications.waset.org/abstracts/83028/capacitated-multiple-allocation-p-hub-median-problem-on-a-cluster-based-network-under-congestion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83028.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">492</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8026</span> Optimal Resource Configuration and Allocation Planning Problem for Bottleneck Machines and Auxiliary Tools</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yin-Yann%20Chen">Yin-Yann Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Tzu-Ling%20Chen"> Tzu-Ling Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents the case of an actual Taiwanese semiconductor assembly and testing manufacturer. Three major bottleneck manufacturing processes, namely, die bond, wire bond, and molding, are analyzed to determine how to use finite resources to achieve the optimal capacity allocation. A medium-term capacity allocation planning model is developed by considering the optimal total profit to satisfy the promised volume demanded by customers and to obtain the best migration decision among production lines for machines and tools. Finally, sensitivity analysis based on the actual case is provided to explore the effect of various parameter levels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=capacity%20planning" title="capacity planning">capacity planning</a>, <a href="https://publications.waset.org/abstracts/search?q=capacity%20allocation" title=" capacity allocation"> capacity allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20migration" title=" machine migration"> machine migration</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20configuration" title=" resource configuration"> resource configuration</a> </p> <a href="https://publications.waset.org/abstracts/49417/optimal-resource-configuration-and-allocation-planning-problem-for-bottleneck-machines-and-auxiliary-tools" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49417.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">461</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8025</span> A Location-Allocation-Routing Model for a Home Health Care Supply Chain Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amir%20Mohammad%20Fathollahi%20Fard">Amir Mohammad Fathollahi Fard</a>, <a href="https://publications.waset.org/abstracts/search?q=Mostafa%20Hajiaghaei-Keshteli"> Mostafa Hajiaghaei-Keshteli</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Mahdi%20Paydar"> Mohammad Mahdi Paydar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With increasing life expectancy in developed countries, the role of home care services is highlighted by both academia and industrial contributors in Home Health Care Supply Chain (HHCSC) companies. The main decisions in such supply chain systems are the location of pharmacies, the allocation of patients to these pharmacies and also the routing and scheduling decisions of nurses to visit their patients. In this study, for the first time, an integrated model is proposed to consist of all preliminary and necessary decisions in these companies, namely, location-allocation-routing model. This model is a type of NP-hard one. Therefore, an Imperialist Competitive Algorithm (ICA) is utilized to solve the model, especially in large sizes. Results confirm the efficiency of the developed model for HHCSC companies as well as the performance of employed ICA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=home%20health%20care%20supply%20chain" title="home health care supply chain">home health care supply chain</a>, <a href="https://publications.waset.org/abstracts/search?q=location-allocation-routing%20problem" title=" location-allocation-routing problem"> location-allocation-routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=imperialist%20competitive%20algorithm" title=" imperialist competitive algorithm"> imperialist competitive algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/82335/a-location-allocation-routing-model-for-a-home-health-care-supply-chain-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82335.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">397</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8024</span> Efficient DCT Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mr.%20P.%20Suryaprasad">Mr. P. Suryaprasad</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Lalitha"> R. Lalitha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an efficient area and delay architectures for the implementation of one dimensional and two dimensional discrete cosine transform (DCT). These are supported to different lengths (4, 8, 16, and 32). DCT blocks are used in the different video coding standards for the image compression. The 2D- DCT calculation is made using the 2D-DCT separability property, such that the whole architecture is divided into two 1D-DCT calculations by using a transpose buffer. Based on the existing 1D-DCT architecture two different types of 2D-DCT architectures, folded and parallel types are implemented. Both of these two structures use the same transpose buffer. Proposed transpose buffer occupies less area and high speed than existing transpose buffer. Hence the area, low power and delay of both the 2D-DCT architectures are reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=transposition%20buffer" title="transposition buffer">transposition buffer</a>, <a href="https://publications.waset.org/abstracts/search?q=video%20compression" title=" video compression"> video compression</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20cosine%20transform" title=" discrete cosine transform"> discrete cosine transform</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20efficiency%20video%20coding" title=" high efficiency video coding"> high efficiency video coding</a>, <a href="https://publications.waset.org/abstracts/search?q=two%20dimensional%20picture" title=" two dimensional picture"> two dimensional picture</a> </p> <a href="https://publications.waset.org/abstracts/33624/efficient-dct-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33624.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">522</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8023</span> Discrete Breeding Swarm for Cost Minimization of Parallel Job Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tarek%20Aboueldahab">Tarek Aboueldahab</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanan%20Farag"> Hanan Farag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Parallel Job Shop Scheduling Problem (JSP) is a multi-objective and multi constrains NP- optimization problem. Traditional Artificial Intelligence techniques have been widely used; however, they could be trapped into the local minimum without reaching the optimum solution, so we propose a hybrid Artificial Intelligence model (AI) with Discrete Breeding Swarm (DBS) added to traditional Artificial Intelligence to avoid this trapping. This model is applied in the cost minimization of the Car Sequencing and Operator Allocation (CSOA) problem. The practical experiment shows that our model outperforms other techniques in cost minimization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20job%20shop%20scheduling%20problem" title="parallel job shop scheduling problem">parallel job shop scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title=" artificial intelligence"> artificial intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20breeding%20swarm" title=" discrete breeding swarm"> discrete breeding swarm</a>, <a href="https://publications.waset.org/abstracts/search?q=car%20sequencing%20and%20operator%20allocation" title=" car sequencing and operator allocation"> car sequencing and operator allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=cost%20minimization" title=" cost minimization"> cost minimization</a> </p> <a href="https://publications.waset.org/abstracts/132701/discrete-breeding-swarm-for-cost-minimization-of-parallel-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132701.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">188</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8022</span> Energy Absorption Characteristic of a Coupler Rubber Buffer Used in Rail Vehicles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhixiang%20Li">Zhixiang Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Shuguang%20Yao"> Shuguang Yao</a>, <a href="https://publications.waset.org/abstracts/search?q=Wen%20Ma"> Wen Ma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Coupler rubber buffer has been widely applied on the high-speed trains and the main function of the rubber buffer is dissipating the impact energy between vehicles. The rubber buffer consists of two groups of rubbers, which are both pre-compressed and then installed into the frame body. This paper focuses on the energy absorption characteristics of the rubber buffers particularly. Firstly, the quasi-static compression tests were carried out for 1 and 3 pairs of rubber sheets and some energy absorption responses relationship, i.e. Eabn = n×Eab1, Edissn = n×Ediss1, and Ean = Ea1, were obtained. Next, a series of quasi-static tests were performed for 1 pair of rubber sheet to investigate the energy absorption performance with different compression ratio of the rubber buffers. Then the impact tests with five impact velocities were conducted and the coupler knuckle was destroyed when the impact velocity was 10.807 km/h. The impact tests results showed that with the increase of impact velocity, the Eab, Ediss and Ea of rear buffer increased a lot, but the three responses of front buffer had not much increase. Finally, the results of impact tests and quasi-static tests were contrastively analysed and the results showed that with the increase of the stroke, the values of Eab, Ediss, and Ea were all increase. However, the increasing rates of impact tests were all larger than that of quasi-static tests. The maximum value of Ea was 68.76% in impact tests, it was a relatively high value for vehicle coupler buffer. The energy capacity of the rear buffer was determined for dynamic loading, it was 22.98 kJ. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rubber%20buffer" title="rubber buffer">rubber buffer</a>, <a href="https://publications.waset.org/abstracts/search?q=coupler" title=" coupler"> coupler</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20absorption" title=" energy absorption"> energy absorption</a>, <a href="https://publications.waset.org/abstracts/search?q=impact%20tests" title=" impact tests"> impact tests</a> </p> <a href="https://publications.waset.org/abstracts/96059/energy-absorption-characteristic-of-a-coupler-rubber-buffer-used-in-rail-vehicles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96059.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">196</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8021</span> Loss Allocation in Radial Distribution Networks for Loads of Composite Types</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sumit%20Banerjee">Sumit Banerjee</a>, <a href="https://publications.waset.org/abstracts/search?q=Chandan%20Kumar%20Chanda"> Chandan Kumar Chanda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper presents allocation of active power losses and energy losses to consumers connected to radial distribution networks in a deregulated environment for loads of composite types. A detailed comparison among four algorithms, namely quadratic loss allocation, proportional loss allocation, pro rata loss allocation and exact loss allocation methods are presented. Quadratic and proportional loss allocations are based on identifying the active and reactive components of current in each branch and the losses are allocated to each consumer, pro rata loss allocation method is based on the load demand of each consumer and exact loss allocation method is based on the actual contribution of active power loss by each consumer. The effectiveness of the proposed comparison among four algorithms for composite load is demonstrated through an example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=composite%20type" title="composite type">composite type</a>, <a href="https://publications.waset.org/abstracts/search?q=deregulation" title=" deregulation"> deregulation</a>, <a href="https://publications.waset.org/abstracts/search?q=loss%20allocation" title=" loss allocation"> loss allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=radial%20distribution%20networks" title=" radial distribution networks"> radial distribution networks</a> </p> <a href="https://publications.waset.org/abstracts/42700/loss-allocation-in-radial-distribution-networks-for-loads-of-composite-types" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42700.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">286</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8020</span> A Simulation Modeling Approach for Optimization of Storage Space Allocation in Container Terminal</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gamal%20Abd%20El-Nasser%20A.%20Said">Gamal Abd El-Nasser A. Said</a>, <a href="https://publications.waset.org/abstracts/search?q=El-Sayed%20M.%20El-Horbaty"> El-Sayed M. El-Horbaty</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Container handling problems at container terminals are NP-hard problems. This paper presents an approach using discrete-event simulation modeling to optimize solution for storage space allocation problem, taking into account all various interrelated container terminal handling activities. The proposed approach is applied on a real case study data of container terminal at Alexandria port. The computational results show the effectiveness of the proposed model for optimization of storage space allocation in container terminal where 54% reduction in containers handling time in port is achieved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=container%20terminal" title="container terminal">container terminal</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete-event%20simulation" title=" discrete-event simulation"> discrete-event simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=storage%20space%20allocation" title=" storage space allocation "> storage space allocation </a> </p> <a href="https://publications.waset.org/abstracts/19699/a-simulation-modeling-approach-for-optimization-of-storage-space-allocation-in-container-terminal" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19699.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">325</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8019</span> Effects of Bacteria on Levels of AFM1 in Phosphate Buffer at Different Level of Energy Source</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20M.%20Elgerbi">Ali M. Elgerbi</a>, <a href="https://publications.waset.org/abstracts/search?q=Obied%20A.%20Alwan"> Obied A. Alwan</a>, <a href="https://publications.waset.org/abstracts/search?q=Al-Taher%20O.%20Alzwei"> Al-Taher O. Alzwei</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdurrahim%20A.%20Elouzi"> Abdurrahim A. Elouzi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The binding of AFM1 to bacteria in phosphate buffer solution depended on many factors such as: availability of energy, incubation period, species and strain of bacteria. Increase in concentration of sugar showed higher removal of AFM1 and faster than in phosphate buffer alone. With 1.0% glucose lactic acid bacteria and bifidobacteria showed toxin removal ranging from 7.7 to 39.7% whereas with 10.0% glucose the percentage removal was 21.8 to 45.4% at 96 hours of incubation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aflatoxin%20M1" title="aflatoxin M1">aflatoxin M1</a>, <a href="https://publications.waset.org/abstracts/search?q=lactic%20acid%20bacteria" title=" lactic acid bacteria"> lactic acid bacteria</a>, <a href="https://publications.waset.org/abstracts/search?q=bifidobacteria" title=" bifidobacteria "> bifidobacteria </a>, <a href="https://publications.waset.org/abstracts/search?q=binding" title=" binding"> binding</a>, <a href="https://publications.waset.org/abstracts/search?q=phosphate%20buffer" title=" phosphate buffer "> phosphate buffer </a> </p> <a href="https://publications.waset.org/abstracts/19875/effects-of-bacteria-on-levels-of-afm1-in-phosphate-buffer-at-different-level-of-energy-source" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19875.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">506</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8018</span> Unbalanced Mean-Time and Buffer Effects in Lines Suffering Breakdown</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sabry%20Shaaban">Sabry Shaaban</a>, <a href="https://publications.waset.org/abstracts/search?q=Tom%20McNamara"> Tom McNamara</a>, <a href="https://publications.waset.org/abstracts/search?q=Sarah%20Hudson"> Sarah Hudson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article studies the performance of unpaced serial production lines that are subject to breakdown and are imbalanced in terms of both of their processing time means (MTs) and buffer storage capacities (BCs). Simulation results show that the best pattern in terms of throughput is a balanced line with respect to average buffer level; the best configuration is a monotone decreasing MT order, together with an ascending BC arrangement. Statistical analysis shows that BC, patterns of MT and BC imbalance, line length and degree of imbalance all contribute significantly to performance. Results show that unbalanced lines cope well with unreliability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unreliable%20unpaced%20serial%20lines" title="unreliable unpaced serial lines">unreliable unpaced serial lines</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=unequal%20mean%20operation%20times" title=" unequal mean operation times"> unequal mean operation times</a>, <a href="https://publications.waset.org/abstracts/search?q=uneven%20buffer%20capacities" title=" uneven buffer capacities"> uneven buffer capacities</a>, <a href="https://publications.waset.org/abstracts/search?q=patterns%20of%20imbalance" title=" patterns of imbalance"> patterns of imbalance</a>, <a href="https://publications.waset.org/abstracts/search?q=throughput" title=" throughput"> throughput</a>, <a href="https://publications.waset.org/abstracts/search?q=average%20buffer%20level" title=" average buffer level"> average buffer level</a> </p> <a href="https://publications.waset.org/abstracts/3491/unbalanced-mean-time-and-buffer-effects-in-lines-suffering-breakdown" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3491.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">473</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=268">268</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=269">269</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=buffer%20allocation%20problem&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>