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: task allocation</title> <meta name="description" content="Search results for: task allocation"> <meta name="keywords" content="task allocation"> <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="task allocation" 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="task allocation"> <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> 2739</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: task allocation</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2739</span> Resource Allocation and Task Scheduling with Skill Level and Time Bound Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salam%20Saudagar">Salam Saudagar</a>, <a href="https://publications.waset.org/abstracts/search?q=Ankit%20Kamboj"> Ankit Kamboj</a>, <a href="https://publications.waset.org/abstracts/search?q=Niraj%20Mohan"> Niraj Mohan</a>, <a href="https://publications.waset.org/abstracts/search?q=Satgounda%20Patil"> Satgounda Patil</a>, <a href="https://publications.waset.org/abstracts/search?q=Nilesh%20Powar"> Nilesh Powar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Task Assignment and Scheduling is a challenging Operations Research problem when there is a limited number of resources and comparatively higher number of tasks. The Cost Management team at Cummins needs to assign tasks based on a deadline and must prioritize some of the tasks as per business requirements. Moreover, there is a constraint on the resources that assignment of tasks should be done based on an individual skill level, that may vary for different tasks. Another constraint is for scheduling the tasks that should be evenly distributed in terms of number of working hours, which adds further complexity to this problem. The proposed greedy approach to solve assignment and scheduling problem first assigns the task based on management priority and then by the closest deadline. This is followed by an iterative selection of an available resource with the least allocated total working hours for a task, i.e. finding the local optimal choice for each task with the goal of determining the global optimum. The greedy approach task allocation is compared with a variant of Hungarian Algorithm, and it is observed that the proposed approach gives an equal allocation of working hours among the resources. The comparative study of the proposed approach is also done with manual task allocation and it is noted that the visibility of the task timeline has increased from 2 months to 6 months. An interactive dashboard app is created for the greedy assignment and scheduling approach and the tasks with more than 2 months horizon that were waiting in a queue without a delivery date initially are now analyzed effectively by the business with expected timelines for completion. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=assignment" title="assignment">assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=deadline" title=" deadline"> deadline</a>, <a href="https://publications.waset.org/abstracts/search?q=greedy%20approach" title=" greedy approach"> greedy approach</a>, <a href="https://publications.waset.org/abstracts/search?q=Hungarian%20algorithm" title=" Hungarian algorithm"> Hungarian algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=operations%20research" title=" operations research"> operations research</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a> </p> <a href="https://publications.waset.org/abstracts/128820/resource-allocation-and-task-scheduling-with-skill-level-and-time-bound-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128820.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">147</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">2738</span> Design and Implementation of an AI-Enabled Task Assistance and Management System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arun%20Prasad%20Jaganathan">Arun Prasad Jaganathan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In today's dynamic industrial world, traditional task allocation methods often fall short in adapting to evolving operational conditions. This paper introduces an AI-enabled task assistance and management system designed to overcome the limitations of conventional approaches. By using artificial intelligence (AI) and machine learning (ML), the system intelligently interprets user instructions, analyzes tasks, and allocates resources based on real-time data and environmental factors. Additionally, geolocation tracking enables proactive identification of potential delays, ensuring timely interventions. With its transparent reporting mechanisms, the system provides stakeholders with clear insights into task progress, fostering accountability and informed decision-making. The paper presents a comprehensive overview of the system architecture, algorithm, and implementation, highlighting its potential to revolutionize task management across diverse industries. <p class="card-text"><strong>Keywords:</strong> <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=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20allocation" title=" task allocation"> task allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=operational%20efficiency" title=" operational efficiency"> operational efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20optimization" title=" resource optimization"> resource optimization</a> </p> <a href="https://publications.waset.org/abstracts/185813/design-and-implementation-of-an-ai-enabled-task-assistance-and-management-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/185813.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">59</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">2737</span> Evolutionary Swarm Robotics: Dynamic Subgoal-Based Path Formation and Task Allocation for Exploration and Navigation in Unknown Environments</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lavanya%20Ratnabala">Lavanya Ratnabala</a>, <a href="https://publications.waset.org/abstracts/search?q=Robinroy%20Peter"> Robinroy Peter</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Y.%20A.%20Charles"> E. Y. A. Charles</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research paper addresses the challenges of exploration and navigation in unknown environments from an evolutionary swarm robotics perspective. Path formation plays a crucial role in enabling cooperative swarm robots to accomplish these tasks. The paper presents a method called the sub-goal-based path formation, which establishes a path between two different locations by exploiting visually connected sub-goals. Simulation experiments conducted in the Argos simulator demonstrate the successful formation of paths in the majority of trials. Furthermore, the paper tackles the problem of inter-collision (traffic) among a large number of robots engaged in path formation, which negatively impacts the performance of the sub-goal-based method. To mitigate this issue, a task allocation strategy is proposed, leveraging local communication protocols and light signal-based communication. The strategy evaluates the distance between points and determines the required number of robots for the path formation task, reducing unwanted exploration and traffic congestion. The performance of the sub-goal-based path formation and task allocation strategy is evaluated by comparing path length, time, and resource reduction against the A* algorithm. The simulation experiments demonstrate promising results, showcasing the scalability, robustness, and fault tolerance characteristics of the proposed approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=swarm" title="swarm">swarm</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20formation" title=" path formation"> path formation</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20allocation" title=" task allocation"> task allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=Argos" title=" Argos"> Argos</a>, <a href="https://publications.waset.org/abstracts/search?q=exploration" title=" exploration"> exploration</a>, <a href="https://publications.waset.org/abstracts/search?q=navigation" title=" navigation"> navigation</a>, <a href="https://publications.waset.org/abstracts/search?q=sub-goal" title=" sub-goal"> sub-goal</a> </p> <a href="https://publications.waset.org/abstracts/182305/evolutionary-swarm-robotics-dynamic-subgoal-based-path-formation-and-task-allocation-for-exploration-and-navigation-in-unknown-environments" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/182305.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">42</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">2736</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">2735</span> The Dangers of Attentional Inertia in the Driving Task</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Catherine%20Thompson">Catherine Thompson</a>, <a href="https://publications.waset.org/abstracts/search?q=Maryam%20Jalali"> Maryam Jalali</a>, <a href="https://publications.waset.org/abstracts/search?q=Peter%20Hills"> Peter Hills</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The allocation of visual attention is critical when driving and anything that limits attention will have a detrimental impact on safety. Engaging in a secondary task reduces the amount of attention directed to the road because drivers allocate resources towards this task, leaving fewer resources to process driving-relevant information. Yet the dangers associated with a secondary task do not end when the driver returns their attention to the road. Instead, the attentional settings adopted to complete a secondary task may persist to the road, affecting attention, and therefore affecting driver performance. This 'attentional inertia' effect was investigated in the current work. Forty drivers searched for hazards in driving video clips while their eye-movements were recorded. At varying intervals they were instructed to attend to a secondary task displayed on a tablet situated to their left-hand side. The secondary task consisted of three separate computer games that induced horizontal, vertical, and random eye movements. Visual search and hazard detection in the driving clips were compared across the three conditions of the secondary task. Results showed that the layout of information in the secondary task, and therefore the allocation of attention in this task, had an impact on subsequent search in the driving clips. Vertically presented information reduced the wide horizontal spread of search usually associated with accurate driving and had a negative influence on the detection of hazards. The findings show the additional dangers of engaging in a secondary task while driving. The attentional inertia effect has significant implications for semi-autonomous and autonomous vehicles in which drivers have greater opportunity to direct their attention away from the driving task. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=attention" title="attention">attention</a>, <a href="https://publications.waset.org/abstracts/search?q=eye-movements" title=" eye-movements"> eye-movements</a>, <a href="https://publications.waset.org/abstracts/search?q=hazard%20perception" title=" hazard perception"> hazard perception</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20search" title=" visual search"> visual search</a> </p> <a href="https://publications.waset.org/abstracts/98055/the-dangers-of-attentional-inertia-in-the-driving-task" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98055.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">165</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">2734</span> FESA: Fuzzy-Controlled Energy-Efficient Selective Allocation and Reallocation of Tasks Among Mobile Robots</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anuradha%20Banerjee">Anuradha Banerjee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Energy aware operation is one of the visionary goals in the area of robotics because operability of robots is greatly dependent upon their residual energy. Practically, the tasks allocated to robots carry different priority and often an upper limit of time stamp is imposed within which the task needs to be completed. If a robot is unable to complete one particular task given to it the task is reallocated to some other robot. The collection of robots is controlled by a Central Monitoring Unit (CMU). Selection of the new robot is performed by a fuzzy controller called Task Reallocator (TRAC). It accepts the parameters like residual energy of robots, possibility that the task will be successfully completed by the new robot within stipulated time, distance of the new robot (where the task is reallocated) from distance of the old one (where the task was going on) etc. The proposed methodology increases the probability of completing globally assigned tasks and saves huge amount of energy as far as the collection of robots is concerned. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy-efficiency" title="energy-efficiency">energy-efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy-controller" title=" fuzzy-controller"> fuzzy-controller</a>, <a href="https://publications.waset.org/abstracts/search?q=priority" title=" priority"> priority</a>, <a href="https://publications.waset.org/abstracts/search?q=reallocation" title=" reallocation"> reallocation</a>, <a href="https://publications.waset.org/abstracts/search?q=task" title=" task"> task</a> </p> <a href="https://publications.waset.org/abstracts/20335/fesa-fuzzy-controlled-energy-efficient-selective-allocation-and-reallocation-of-tasks-among-mobile-robots" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20335.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">316</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">2733</span> Multi-Level Priority Based Task Scheduling Algorithm for Workflows in Cloud Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anju%20Bala">Anju Bala</a>, <a href="https://publications.waset.org/abstracts/search?q=Inderveer%20Chana"> Inderveer Chana</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Task scheduling is the key concern for the execution of performance-driven workflow applications. As efficient scheduling can have major impact on the performance of the system, task scheduling is often chosen for assigning the request to resources in an efficient way based on cloud resource characteristics. In this paper, priority based task scheduling algorithm has been proposed that prioritizes the tasks based on the length of the instructions. The proposed scheduling approach prioritize the tasks of Cloud applications according to the limits set by six sigma control charts based on dynamic threshold values. Further, the proposed algorithm has been validated through the CloudSim toolkit. The experimental results demonstrate that the proposed algorithm is effective for handling multiple task lists from workflows and in considerably reducing Makespan and Execution time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=priority%20based%20scheduling" title=" priority based scheduling"> priority based scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20scheduling" title=" task scheduling"> task scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=VM%20allocation" title=" VM allocation"> VM allocation</a> </p> <a href="https://publications.waset.org/abstracts/23630/multi-level-priority-based-task-scheduling-algorithm-for-workflows-in-cloud-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23630.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">2732</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">2731</span> Artificial Intelligent-Based Approaches for Task ‎Offloading, ‎Resource ‎Allocation and Service ‎Placement of ‎Internet of Things ‎Applications: State of the Art</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fatima%20Z.%20Cherhabil">Fatima Z. Cherhabil</a>, <a href="https://publications.waset.org/abstracts/search?q=Mammar%20Sedrati"> Mammar Sedrati</a>, <a href="https://publications.waset.org/abstracts/search?q=Sonia-Sabrina%20Bendib%E2%80%8E"> Sonia-Sabrina Bendib‎</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to support the continued growth, critical latency of ‎IoT ‎applications, and ‎various obstacles of traditional data centers, ‎mobile edge ‎computing (MEC) has ‎emerged as a promising solution that extends cloud data-processing and decision-making to edge devices. ‎By adopting a MEC structure, IoT applications could be executed ‎locally, on ‎an edge server, different fog nodes, or distant cloud ‎data centers. However, we are ‎often ‎faced with wanting to optimize conflicting criteria such as ‎minimizing energy ‎consumption of limited local capabilities (in terms of CPU, RAM, storage, bandwidth) of mobile edge ‎devices and trying to ‎keep ‎high performance (reducing ‎response time, increasing throughput and service availability) ‎at the same ‎time‎. Achieving one goal may affect the other, making task offloading (TO), ‎resource allocation (RA), and service placement (SP) complex ‎processes. ‎It is a nontrivial multi-objective optimization ‎problem ‎to study the trade-off between conflicting criteria. ‎The paper provides a survey on different TO, SP, and RA recent multi-‎objective optimization (MOO) approaches used in edge computing environments, particularly artificial intelligent (AI) ones, to satisfy various objectives, constraints, and dynamic conditions related to IoT applications‎. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mobile%20edge%20computing" title="mobile edge computing">mobile edge computing</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=artificial%20%E2%80%8Eintelligence%20%E2%80%8Eapproaches" title=" artificial ‎intelligence ‎approaches"> artificial ‎intelligence ‎approaches</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20offloading" title=" task offloading"> task offloading</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=%E2%80%8E%20service%20placement" title="‎ service placement">‎ service placement</a> </p> <a href="https://publications.waset.org/abstracts/150855/artificial-intelligent-based-approaches-for-task-offloading-resource-allocation-and-service-placement-of-internet-of-things-applications-state-of-the-art" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150855.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">115</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">2730</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">2729</span> A New Reliability Allocation Method Based on Fuzzy Numbers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Peng%20Li">Peng Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Chuanri%20Li"> Chuanri Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Tao%20Li"> Tao Li </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reliability allocation is quite important during early design and development stages for a system to apportion its specified reliability goal to subsystems. This paper improves the reliability fuzzy allocation method and gives concrete processes on determining the factor set, the factor weight set, judgment set, and multi-grade fuzzy comprehensive evaluation. To determine the weight of factor set, the modified trapezoidal numbers are proposed to reduce errors caused by subjective factors. To decrease the fuzziness in the fuzzy division, an approximation method based on linear programming is employed. To compute the explicit values of fuzzy numbers, centroid method of defuzzification is considered. An example is provided to illustrate the application of the proposed reliability allocation method based on fuzzy arithmetic. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reliability%20allocation" title="reliability allocation">reliability allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20arithmetic" title=" fuzzy arithmetic"> fuzzy arithmetic</a>, <a href="https://publications.waset.org/abstracts/search?q=allocation%20weight" title=" allocation weight"> allocation weight</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming "> linear programming </a> </p> <a href="https://publications.waset.org/abstracts/27101/a-new-reliability-allocation-method-based-on-fuzzy-numbers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27101.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">342</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">2728</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">2727</span> A New Method to Winner Determination for Economic Resource Allocation in Cloud Computing Systems </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ebrahim%20Behrouzian%20Nejad">Ebrahim Behrouzian Nejad</a>, <a href="https://publications.waset.org/abstracts/search?q=Rezvan%20Alipoor%20Sabzevari"> Rezvan Alipoor Sabzevari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud computing systems are large-scale distributed systems, so that they focus more on large scale resource sharing, cooperation of several organizations and their use in new applications. One of the main challenges in this realm is resource allocation. There are many different ways to resource allocation in cloud computing. One of the common methods to resource allocation are economic methods. Among these methods, the auction-based method has greater prominence compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. This method includes two phases: winner determination and resource allocation. In this paper a new method has been presented to determine winner in double combinatorial auction-based resource allocation using Imperialist Competitive Algorithm (ICA). The experimental results show that in our new proposed the number of winner users is higher than genetic algorithm. On other hand, in proposed algorithm, the number of winner providers is higher in genetic algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</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=double%20auction" title=" double auction"> double auction</a>, <a href="https://publications.waset.org/abstracts/search?q=winner%20determination" title=" winner determination "> winner determination </a> </p> <a href="https://publications.waset.org/abstracts/35920/a-new-method-to-winner-determination-for-economic-resource-allocation-in-cloud-computing-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35920.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">359</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">2726</span> Dynamic Bandwidth Allocation in Fiber-Wireless (FiWi) Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eman%20I.%20Raslan">Eman I. Raslan</a>, <a href="https://publications.waset.org/abstracts/search?q=Haitham%20S.%20Hamza"> Haitham S. Hamza</a>, <a href="https://publications.waset.org/abstracts/search?q=Reda%20A.%20El-Khoribi"> Reda A. El-Khoribi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fiber-Wireless (FiWi) networks are a promising candidate for future broadband access networks. These networks combine the optical network as the back end where different passive optical network (PON) technologies are realized and the wireless network as the front end where different wireless technologies are adopted, e.g. LTE, WiMAX, Wi-Fi, and Wireless Mesh Networks (WMNs). The convergence of both optical and wireless technologies requires designing architectures with robust efficient and effective bandwidth allocation schemes. Different bandwidth allocation algorithms have been proposed in FiWi networks aiming to enhance the different segments of FiWi networks including wireless and optical subnetworks. In this survey, we focus on the differentiating between the different bandwidth allocation algorithms according to their enhancement segment of FiWi networks. We classify these techniques into wireless, optical and Hybrid bandwidth allocation techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fiber-wireless%20%28FiWi%29" title="fiber-wireless (FiWi)">fiber-wireless (FiWi)</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20bandwidth%20allocation%20%28DBA%29" title=" dynamic bandwidth allocation (DBA)"> dynamic bandwidth allocation (DBA)</a>, <a href="https://publications.waset.org/abstracts/search?q=passive%20optical%20networks%20%28PON%29" title=" passive optical networks (PON)"> passive optical networks (PON)</a>, <a href="https://publications.waset.org/abstracts/search?q=media%20access%20control%20%28MAC%29" title=" media access control (MAC)"> media access control (MAC)</a> </p> <a href="https://publications.waset.org/abstracts/43649/dynamic-bandwidth-allocation-in-fiber-wireless-fiwi-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43649.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">531</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">2725</span> Streaming Communication Component for Multi-Robots</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=George%20Oliveira">George Oliveira</a>, <a href="https://publications.waset.org/abstracts/search?q=Luana%20D.%20Fronza"> Luana D. Fronza</a>, <a href="https://publications.waset.org/abstracts/search?q=Luiza%20Medeiros"> Luiza Medeiros</a>, <a href="https://publications.waset.org/abstracts/search?q=Patricia%20D.%20M.%20Plentz"> Patricia D. M. Plentz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The research presented in this article is part of a wide project that proposes a scheduling system for multi-robots in intelligent warehouses employing multi-robot path-planning (MPP) and multi-robot task allocation (MRTA) to reconcile multiple restrictions (task delivery time, task priorities, charging capacity, and robots battery capacity). We present the software component capable of interconnecting an open streaming processing architecture and robot operating system (ROS), ensuring communication and message exchange between robots and the environment in which they are inserted. Simulation results show the good performance of our proposed technique for connecting ROS and streaming platforms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=complex%20distributed%20systems" title="complex distributed systems">complex distributed systems</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20robots" title=" mobile robots"> mobile robots</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20warehouses" title=" smart warehouses"> smart warehouses</a>, <a href="https://publications.waset.org/abstracts/search?q=streaming%20platforms" title=" streaming platforms"> streaming platforms</a> </p> <a href="https://publications.waset.org/abstracts/136693/streaming-communication-component-for-multi-robots" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136693.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">194</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">2724</span> Cryptographic Resource Allocation Algorithm Based on Deep Reinforcement Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xu%20Jie">Xu Jie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As a key network security method, cryptographic services must fully cope with problems such as the wide variety of cryptographic algorithms, high concurrency requirements, random job crossovers, and instantaneous surges in workloads. Its complexity and dynamics also make it difficult for traditional static security policies to cope with the ever-changing situation. Cyber Threats and Environment. Traditional resource scheduling algorithms are inadequate when facing complex decision-making problems in dynamic environments. A network cryptographic resource allocation algorithm based on reinforcement learning is proposed, aiming to optimize task energy consumption, migration cost, and fitness of differentiated services (including user, data, and task security) by modeling the multi-job collaborative cryptographic service scheduling problem as a multi-objective optimized job flow scheduling problem and using a multi-agent reinforcement learning method, efficient scheduling and optimal configuration of cryptographic service resources are achieved. By introducing reinforcement learning, resource allocation strategies can be adjusted in real-time in a dynamic environment, improving resource utilization and achieving load balancing. Experimental results show that this algorithm has significant advantages in path planning length, system delay and network load balancing and effectively solves the problem of complex resource scheduling in cryptographic services. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography%20on-demand%20service" title=" cryptography on-demand service"> cryptography on-demand service</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=workflow%20scheduling" title=" workflow scheduling"> workflow scheduling</a> </p> <a href="https://publications.waset.org/abstracts/193329/cryptographic-resource-allocation-algorithm-based-on-deep-reinforcement-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/193329.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">15</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">2723</span> Design Criteria for an Internal Information Technology Cost Allocation to Support Business Information Technology Alignment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Andrea%20Schnabl">Andrea Schnabl</a>, <a href="https://publications.waset.org/abstracts/search?q=Mario%20Bernhart"> Mario Bernhart</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The controlling instrument of an internal cost allocation (IT chargeback) is commonly used to make IT costs transparent and controllable. Information Technology (IT) became, especially for information industries, a central competitive factor. Consequently, the focus is not on minimizing IT costs but on the strategic aligned application of IT. Hence, an internal IT cost allocation should be designed to enhance the business-IT alignment (strategic alignment of IT) in order to support the effective application of IT from a company’s point of view. To identify design criteria for an internal cost allocation to support business alignment a case study analysis at a typical medium-sized firm in information industry is performed. Documents, Key Performance Indicators, and cost accounting data over a period of 10 years are analyzed and interviews are performed. The derived design criteria are evaluated by 6 heads of IT departments from 6 different companies, which have an internal IT cost allocation at use. By applying these design criteria an internal cost allocation serves not only for cost controlling but also as an instrument in strategic IT management. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accounting%20for%20IT%20services" title="accounting for IT services">accounting for IT services</a>, <a href="https://publications.waset.org/abstracts/search?q=Business%20IT%20Alignment" title=" Business IT Alignment"> Business IT Alignment</a>, <a href="https://publications.waset.org/abstracts/search?q=internal%20cost%20allocation" title=" internal cost allocation"> internal cost allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=IT%20controlling" title=" IT controlling"> IT controlling</a>, <a href="https://publications.waset.org/abstracts/search?q=IT%20governance" title=" IT governance"> IT governance</a>, <a href="https://publications.waset.org/abstracts/search?q=strategic%20IT%20management" title=" strategic IT management"> strategic IT management</a> </p> <a href="https://publications.waset.org/abstracts/93449/design-criteria-for-an-internal-information-technology-cost-allocation-to-support-business-information-technology-alignment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93449.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">155</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">2722</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">2721</span> Task Scheduling and Resource Allocation in Cloud-based on AHP Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zahra%20Ahmadi">Zahra Ahmadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Fazlollah%20Adibnia"> Fazlollah Adibnia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scheduling of tasks and the optimal allocation of resources in the cloud are based on the dynamic nature of tasks and the heterogeneity of resources. Applications that are based on the scientific workflow are among the most widely used applications in this field, which are characterized by high processing power and storage capacity. In order to increase their efficiency, it is necessary to plan the tasks properly and select the best virtual machine in the cloud. The goals of the system are effective factors in scheduling tasks and resource selection, which depend on various criteria such as time, cost, current workload and processing power. Multi-criteria decision-making methods are a good choice in this field. In this research, a new method of work planning and resource allocation in a heterogeneous environment based on the modified AHP algorithm is proposed. In this method, the scheduling of input tasks is based on two criteria of execution time and size. Resource allocation is also a combination of the AHP algorithm and the first-input method of the first client. Resource prioritization is done with the criteria of main memory size, processor speed and bandwidth. What is considered in this system to modify the AHP algorithm Linear Max-Min and Linear Max normalization methods are the best choice for the mentioned algorithm, which have a great impact on the ranking. The simulation results show a decrease in the average response time, return time and execution time of input tasks in the proposed method compared to similar methods (basic methods). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20analytical%20process" title="hierarchical analytical process">hierarchical analytical process</a>, <a href="https://publications.waset.org/abstracts/search?q=work%20prioritization" title=" work prioritization"> work prioritization</a>, <a href="https://publications.waset.org/abstracts/search?q=normalization" title=" normalization"> normalization</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20resource%20allocation" title=" heterogeneous resource allocation"> heterogeneous resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=scientific%20workflow" title=" scientific workflow"> scientific workflow</a> </p> <a href="https://publications.waset.org/abstracts/145792/task-scheduling-and-resource-allocation-in-cloud-based-on-ahp-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/145792.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">145</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">2720</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">2719</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">2718</span> A Succinct Method for Allocation of Reactive Power Loss in Deregulated Scenario</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20S.%20Savier">J. S. Savier</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Real power is the component power which is converted into useful energy whereas reactive power is the component of power which cannot be converted to useful energy but it is required for the magnetization of various electrical machineries. If the reactive power is compensated at the consumer end, the need for reactive power flow from generators to the load can be avoided and hence the overall power loss can be reduced. In this scenario, this paper presents a succinct method called JSS method for allocation of reactive power losses to consumers connected to radial distribution networks in a deregulated environment. The proposed method has the advantage that no assumptions are made while deriving the reactive power loss allocation method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=deregulation" title="deregulation">deregulation</a>, <a href="https://publications.waset.org/abstracts/search?q=reactive%20power%20loss%20allocation" title=" reactive power loss allocation"> reactive power loss allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=radial%20distribution%20systems" title=" radial distribution systems"> radial distribution systems</a>, <a href="https://publications.waset.org/abstracts/search?q=succinct%20method" title=" succinct method"> succinct method</a> </p> <a href="https://publications.waset.org/abstracts/47667/a-succinct-method-for-allocation-of-reactive-power-loss-in-deregulated-scenario" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47667.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">376</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">2717</span> Optimisation of B2C Supply Chain Resource Allocation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Firdaous%20Zair">Firdaous Zair</a>, <a href="https://publications.waset.org/abstracts/search?q=Zoubir%20Elfelsoufi"> Zoubir Elfelsoufi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Fourka"> Mohammed Fourka</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The allocation of resources is an issue that is needed on the tactical and operational strategic plan. This work considers the allocation of resources in the case of pure players, manufacturers and Click & Mortars that have launched online sales. The aim is to improve the level of customer satisfaction and maintaining the benefits of e-retailer and of its cooperators and reducing costs and risks. Our contribution is a decision support system and tool for improving the allocation of resources in logistics chains e-commerce B2C context. We first modeled the B2C chain with all operations that integrates and possible scenarios since online retailers offer a wide selection of personalized service. The personalized services that online shopping companies offer to the clients can be embodied in many aspects, such as the customizations of payment, the distribution methods, and after-sales service choices. In addition, every aspect of customized service has several modes. At that time, we analyzed the optimization problems of supply chain resource allocation in customized online shopping service mode, which is different from the supply chain resource allocation under traditional manufacturing or service circumstances. Then we realized an optimization model and algorithm for the development based on the analysis of the allocation of the B2C supply chain resources. It is a multi-objective optimization that considers the collaboration of resources in operations, time and costs but also the risks and the quality of services as well as dynamic and uncertain characters related to the request. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=e-commerce" title="e-commerce">e-commerce</a>, <a href="https://publications.waset.org/abstracts/search?q=supply%20chain" title=" supply chain"> supply chain</a>, <a href="https://publications.waset.org/abstracts/search?q=B2C" title=" B2C"> B2C</a>, <a href="https://publications.waset.org/abstracts/search?q=optimisation" title=" optimisation"> optimisation</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a> </p> <a href="https://publications.waset.org/abstracts/42106/optimisation-of-b2c-supply-chain-resource-allocation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42106.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">272</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">2716</span> Effects of Pre-Task Activities on the Writing Performance of Second Language Learners</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wajiha%20Fatima">Wajiha Fatima</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Based on Rod Ellis’s (2002) the methodology of task-based teaching, this study explored the effects of pre-task activities on the Job Application letter of 102 ESL students (who were female and undergraduate learners). For this purpose, students were divided among three groups (Group A, Group B, and Group C), kept in control and experimental settings as well. Pre-task phase motivates the learners to perform the actual task. Ellis reportedly discussed four pre-task phases: (1) performing a similar task; (2) providing a model; (3) non-task preparation activities and (4) strategic planning. They were taught through above given three pre-task activities. Accordingly, the learners in control setting were supposed to write without any teaching aid while learners in an experimental situation were provided three different pre-task activities in each group. In order to compare the scores of the pre-test and post-test of the three groups, sample paired t-test was utilized. The obtained results of the written job application by the female students revealed that pre-task activities improved their performance in writing. On the other hand, the comparison of the three pre-task activities revealed that 'providing a model' outperformed the other two activities. For this purpose, ANOVA was utilized. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pre-task%20activities" title="pre-task activities">pre-task activities</a>, <a href="https://publications.waset.org/abstracts/search?q=second%20language%20learners" title=" second language learners"> second language learners</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20based%20language%20teaching" title=" task based language teaching"> task based language teaching</a>, <a href="https://publications.waset.org/abstracts/search?q=writing" title=" writing"> writing</a> </p> <a href="https://publications.waset.org/abstracts/100283/effects-of-pre-task-activities-on-the-writing-performance-of-second-language-learners" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/100283.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">178</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">2715</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">2714</span> Energy-Aware Scheduling in Real-Time Systems: An Analysis of Fair Share Scheduling and Priority-Driven Preemptive Scheduling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Su%20Xiaohan">Su Xiaohan</a>, <a href="https://publications.waset.org/abstracts/search?q=Jin%20Chicheng"> Jin Chicheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Liu%20Yijing"> Liu Yijing</a>, <a href="https://publications.waset.org/abstracts/search?q=Burra%20Venkata%20Durga%20Kumar"> Burra Venkata Durga Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Energy-aware scheduling in real-time systems aims to minimize energy consumption, but issues related to resource reservation and timing constraints remain challenges. This study focuses on analyzing two scheduling algorithms, Fair-Share Scheduling (FFS) and Priority-Driven Preemptive Scheduling (PDPS), for solving these issues and energy-aware scheduling in real-time systems. Based on research on both algorithms and the processes of solving two problems, it can be found that Fair-Share Scheduling ensures fair allocation of resources but needs to improve with an imbalanced system load, and Priority-Driven Preemptive Scheduling prioritizes tasks based on criticality to meet timing constraints through preemption but relies heavily on task prioritization and may not be energy efficient. Therefore, improvements to both algorithms with energy-aware features will be proposed. Future work should focus on developing hybrid scheduling techniques that minimize energy consumption through intelligent task prioritization, resource allocation, and meeting time constraints. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy-aware%20scheduling" title="energy-aware scheduling">energy-aware scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=fair-share%20scheduling" title=" fair-share scheduling"> fair-share scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=priority-driven%20preemptive%20scheduling" title=" priority-driven preemptive scheduling"> priority-driven preemptive scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=real-time%20systems" title=" real-time systems"> real-time systems</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20reservation" title=" resource reservation"> resource reservation</a>, <a href="https://publications.waset.org/abstracts/search?q=timing%20constraints" title=" timing constraints"> timing constraints</a> </p> <a href="https://publications.waset.org/abstracts/169550/energy-aware-scheduling-in-real-time-systems-an-analysis-of-fair-share-scheduling-and-priority-driven-preemptive-scheduling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/169550.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">119</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">2713</span> Understanding How Democratic Governance Influence Resource Allocation and Utilisation in Economies in Transition: The Case of Cameroon</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Terence%20Maisah%20Seka">Terence Maisah Seka </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper examines democratic governance within the private and public sectors in economies in transition (Cameroon) by exploring how they influence development in terms of resource allocation to priorities that are locally conceptualized. The benefit of this is an improvement in indigenous and the quality of life for the local population. Using an ethnographic approach, this paper suggests that institutional corruption and state bureaucracy has limited the impact of democratic governance in influencing development. This has seen funds for developments being embezzled; local projects are not being done to satisfaction among others. The paper contributes by proposing measures to eliminate corruption to improve democratic governance, which will improve resource allocation and utilization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=democratic%20governance" title="democratic governance">democratic governance</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=utilisation" title=" utilisation"> utilisation</a>, <a href="https://publications.waset.org/abstracts/search?q=Cameroon" title=" Cameroon"> Cameroon</a> </p> <a href="https://publications.waset.org/abstracts/105236/understanding-how-democratic-governance-influence-resource-allocation-and-utilisation-in-economies-in-transition-the-case-of-cameroon" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/105236.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">2712</span> Study on Resource Allocation of Cloud Operating System Based on Multi-Tenant Data Resource Sharing Technology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lin%20Yunuo">Lin Yunuo</a>, <a href="https://publications.waset.org/abstracts/search?q=Seow%20Xing%20Quan"> Seow Xing Quan</a>, <a href="https://publications.waset.org/abstracts/search?q=Burra%20Venkata%20Durga%20Kumar"> Burra Venkata Durga Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this modern era, the cloud operating system is the world trend applied in various industries such as business, healthy, etc. In order to deal with the large capacity of requirements in cloud computing, research come up with multi-tenant cloud computing to maximize the benefits of server providers and clients. However, there are still issues in multi-tenant cloud computing especially regarding resource allocation. Issues such as inefficient resource utilization, large latency, lack of scalability and elasticity and poor data isolation had caused inefficient resource allocation in multi-tenant cloud computing. Without a doubt, these issues prevent multitenancy reaches its best condition. In fact, there are multiple studies conducted to determine the optimal resource allocation to solve these problems these days. This article will briefly introduce the cloud operating system, Multi-tenant cloud computing and resource allocation in cloud computing. It then discusses resource allocation in multi-tenant cloud computing and the current challenges it faces. According to the issue ‘ineffective resource utilization’, we will discuss an efficient dynamic scheduling technique for multitenancy, namely Multi-tenant Dynamic Resource Scheduling Model (MTDRSM). Moreover, there also have some recommendations to improve the shortcoming of this model in this paper’s final section. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20operation%20system" title=" cloud operation system"> cloud operation system</a>, <a href="https://publications.waset.org/abstracts/search?q=multitenancy" title=" multitenancy"> multitenancy</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=utilization%20of%20cloud%20resources" title=" utilization of cloud resources"> utilization of cloud resources</a> </p> <a href="https://publications.waset.org/abstracts/168893/study-on-resource-allocation-of-cloud-operating-system-based-on-multi-tenant-data-resource-sharing-technology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168893.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">85</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">2711</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">326</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">2710</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> <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=task%20allocation&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=task%20allocation&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=task%20allocation&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=task%20allocation&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=task%20allocation&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=task%20allocation&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=task%20allocation&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=task%20allocation&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=task%20allocation&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=task%20allocation&page=91">91</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=task%20allocation&page=92">92</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=task%20allocation&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>