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: crew scheduling</title> <meta name="description" content="Search results for: crew scheduling"> <meta name="keywords" content="crew scheduling"> <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="crew scheduling" 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="crew scheduling"> <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> 472</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: crew scheduling</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">472</span> Review on Crew Scheduling of Bus Transit: A Case Study in Kolkata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sapan%20Tiwari">Sapan Tiwari</a>, <a href="https://publications.waset.org/abstracts/search?q=Namrata%20Ghosh"> Namrata Ghosh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In urban mass transit, crew scheduling always plays a significant role. It deals with the formulation of work timetables for its staff so that an organization can meet the demand for its products or services. The efficient schedules of a specified timetable have an enormous impact on staff demand. It implies that an urban mass transit company's financial outcomes are strongly associated with planning operations in the region. The research aims to demonstrate the state of the crew scheduling studies and its practical implementation in mass transit businesses in metropolitan areas. First, there is a short overview of past studies in the field. Subsequently, the restrictions and problems with crew scheduling and some models, which have been developed to solve the related issues with their mathematical formulation, are defined. The comments are completed by a description of the solution opportunities provided by computer-aided scheduling program systems for operational use and exposures from urban mass transit organizations. Furthermore, Bus scheduling is performed using the Hungarian technique of problem-solving tasks and mathematical modeling. Afterward, the crew scheduling problem, which consists of developing duties using predefined tasks with set start and end times and places, is resolved. Each duty has to comply with a set line of work. The objective is to minimize a mixture of fixed expenses (number of duties) and varying costs. After the optimization of cost, the outcome of the research is that the same frequency can be provided with fewer buses and less workforce. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=crew%20scheduling" title="crew scheduling">crew scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=duty" title=" duty"> duty</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20of%20cost" title=" optimization of cost"> optimization of cost</a>, <a href="https://publications.waset.org/abstracts/search?q=urban%20mass%20transit" title=" urban mass transit"> urban mass transit</a> </p> <a href="https://publications.waset.org/abstracts/111901/review-on-crew-scheduling-of-bus-transit-a-case-study-in-kolkata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/111901.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">150</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">471</span> Overview of Time, Resource and Cost Planning Techniques in Construction Management Research</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Gupta">R. Gupta</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Jain"> P. Jain</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Das"> S. Das</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One way to approach construction scheduling optimization problem is to focus on the individual aspects of planning, which can be broadly classified as time scheduling, crew and resource management, and cost control. During the last four decades, construction planning has seen a lot of research, but to date, no paper had attempted to summarize the literature available under important heads. This paper addresses each of aspects separately, and presents the findings of an in-depth literature of the various planning techniques. For techniques dealing with time scheduling, the authors have adopted a rough chronological documentation. For crew and resource management, classification has been done on the basis of the different steps involved in the resource planning process. For cost control, techniques dealing with both estimation of costs and the subsequent optimization of costs have been dealt with separately. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=construction%20planning%20techniques" title="construction planning techniques">construction planning techniques</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20scheduling" title=" time scheduling"> time scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20planning" title=" resource planning"> resource planning</a>, <a href="https://publications.waset.org/abstracts/search?q=cost%20control" title=" cost control"> cost control</a> </p> <a href="https://publications.waset.org/abstracts/24164/overview-of-time-resource-and-cost-planning-techniques-in-construction-management-research" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24164.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">487</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">470</span> Assignment of Airlines Technical Members under Disruption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Walid%20Moudani">Walid Moudani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Crew Reserve Assignment Problem (CRAP) considers the assignment of the crew members to a set of reserve activities covering all the scheduled flights in order to ensure a continuous plan so that operations costs are minimized while its solution must meet hard constraints resulting from the safety regulations of Civil Aviation as well as from the airlines internal agreements. The problem considered in this study is of highest interest for airlines and may have important consequences on the service quality and on the economic return of the operations. In this communication, a new mathematical formulation for the CRAP is proposed which takes into account the regulations and the internal agreements. While current solutions make use of Artificial Intelligence techniques run on main frame computers, a low cost approach is proposed to provide on-line efficient solutions to face perturbed operating conditions. The proposed solution method uses a dynamic programming approach for the duties scheduling problem and when applied to the case of a medium airline while providing efficient solutions, shows good potential acceptability by the operations staff. This optimization scheme can then be considered as the core of an on-line Decision Support System for crew reserve assignment operations management. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=airlines%20operations%20management" title="airlines operations management">airlines operations management</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization" title=" combinatorial optimization"> combinatorial optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming" title=" dynamic programming"> dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=crew%20scheduling" title=" crew scheduling"> crew scheduling</a> </p> <a href="https://publications.waset.org/abstracts/6807/assignment-of-airlines-technical-members-under-disruption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6807.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">354</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">469</span> A Column Generation Based Algorithm for Airline Cabin Crew Rostering Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nan%20Xu">Nan Xu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In airlines, the crew scheduling problem is usually decomposed into two stages: crew pairing and crew rostering. In the crew pairing stage, pairings are generated such that each flight is covered by exactly one pairing and the overall cost is minimized. In the crew rostering stage, the pairings generated in the crew pairing stage are combined with off days, training and other breaks to create individual work schedules. The paper focuses on cabin crew rostering problem, which is challenging due to the extremely large size and the complex working rules involved. In our approach, the objective of rostering consists of two major components. The first is to minimize the number of unassigned pairings and the second is to ensure the fairness to crew members. There are two measures of fairness to crew members, the number of overnight duties and the total fly-hour over a given period. Pairings should be assigned to each crew member so that their actual overnight duties and fly hours are as close to the expected average as possible. Deviations from the expected average are penalized in the objective function. Since several small deviations are preferred than a large deviation, the penalization is quadratic. Our model of the airline crew rostering problem is based on column generation. The problem is decomposed into a master problem and subproblems. The mater problem is modeled as a set partition problem and exactly one roster for each crew is picked up such that the pairings are covered. The restricted linear master problem (RLMP) is considered. The current subproblem tries to find columns with negative reduced costs and add them to the RLMP for the next iteration. When no column with negative reduced cost can be found or a stop criteria is met, the procedure ends. The subproblem is to generate feasible crew rosters for each crew member. A separate acyclic weighted graph is constructed for each crew member and the subproblem is modeled as resource constrained shortest path problems in the graph. Labeling algorithm is used to solve it. Since the penalization is quadratic, a method to deal with non-additive shortest path problem using labeling algorithm is proposed and corresponding domination condition is defined. The major contribution of our model is: 1) We propose a method to deal with non-additive shortest path problem; 2) Operation to allow relaxing some soft rules is allowed in our algorithm, which can improve the coverage rate; 3) Multi-thread techniques are used to improve the efficiency of the algorithm when generating Line-of-Work for crew members. Here a column generation based algorithm for the airline cabin crew rostering problem is proposed. The objective is to assign a personalized roster to crew member which minimize the number of unassigned pairings and ensure the fairness to crew members. The algorithm we propose in this paper has been put into production in a major airline in China and numerical experiments show that it has a good performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aircrew%20rostering" title="aircrew rostering">aircrew rostering</a>, <a href="https://publications.waset.org/abstracts/search?q=aircrew%20scheduling" title=" aircrew scheduling"> aircrew scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=column%20generation" title=" column generation"> column generation</a>, <a href="https://publications.waset.org/abstracts/search?q=SPPRC" title=" SPPRC"> SPPRC</a> </p> <a href="https://publications.waset.org/abstracts/74722/a-column-generation-based-algorithm-for-airline-cabin-crew-rostering-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74722.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">146</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">468</span> An Investigation of Thai Passengers’ Level of Understanding and Awareness: Cabin Crew Safety Briefing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chantarat%20Manvichien">Chantarat Manvichien</a>, <a href="https://publications.waset.org/abstracts/search?q=Kevin%20Wongleedee"> Kevin Wongleedee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this research was to study Thai passengers’ level of understanding and awareness of the cabin crew safety briefing in the airplane during the preparation to take off and landing. It is important to know if Thai passengers pay attention to cabin crew safety briefing and to suggest a better way to draw their attention. The independent variables included gender, age, income, levels of education, travelling purpose, and travelling frequency while the dependent variables was level of awareness. A simple random sampling method was utilized to get 400 respondents. The findings revealed the ranking the first three levels of importance by highest mean to lowest mean as follows: (1) It is important to listen to cabin crew safety briefing; (2) Cabin crew briefing is interesting; (3) Information from cabin crew safety briefing is easy to understand. In addition, the overall means was 3.27 with 0.800 SD. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cabin%20crew" title="cabin crew">cabin crew</a>, <a href="https://publications.waset.org/abstracts/search?q=safety%20briefing" title=" safety briefing"> safety briefing</a>, <a href="https://publications.waset.org/abstracts/search?q=Thai%20passengers" title=" Thai passengers"> Thai passengers</a>, <a href="https://publications.waset.org/abstracts/search?q=awareness" title=" awareness"> awareness</a> </p> <a href="https://publications.waset.org/abstracts/14645/an-investigation-of-thai-passengers-level-of-understanding-and-awareness-cabin-crew-safety-briefing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14645.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">402</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">467</span> Analytical Study of CPU Scheduling Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Keshav%20Rathi">Keshav Rathi</a>, <a href="https://publications.waset.org/abstracts/search?q=Aakriti%20Sharma"> Aakriti Sharma</a>, <a href="https://publications.waset.org/abstracts/search?q=Vinayak%20R.%20Dinesh"> Vinayak R. Dinesh</a>, <a href="https://publications.waset.org/abstracts/search?q=Irfan%20Ramzan%20Parray"> Irfan Ramzan Parray</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scheduling is a basic operating system function since practically all computer resources are scheduled before use. The CPU is one of the most important computer resources. Central Processing Unit (CPU) scheduling is vital because it allows the CPU to transition between processes. A processor is the most significant resource in a computer; the operating system can increase the computer's productivity. The objective of the operating system is to allow as many processes as possible to operate at the same time in order to maximize CPU utilization. The highly efficient CPU scheduler is based on the invention of high-quality scheduling algorithms that meet the scheduling objectives. In this paper, we reviewed various fundamental CPU scheduling algorithms for a single CPU and showed which algorithm is best for the particular situation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer%20science" title="computer science">computer science</a>, <a href="https://publications.waset.org/abstracts/search?q=Operating%20system" title=" Operating system"> Operating system</a>, <a href="https://publications.waset.org/abstracts/search?q=CPU%20scheduling" title=" CPU scheduling"> CPU scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=cpu%20algorithms" title=" cpu algorithms"> cpu algorithms</a> </p> <a href="https://publications.waset.org/abstracts/194885/analytical-study-of-cpu-scheduling-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/194885.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">8</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">466</span> Towards Developing a Self-Explanatory Scheduling System Based on a Hybrid Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jian%20Zheng">Jian Zheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Yoshiyasu%20Takahashi"> Yoshiyasu Takahashi</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuichi%20Kobayashi"> Yuichi Kobayashi</a>, <a href="https://publications.waset.org/abstracts/search?q=Tatsuhiro%20Sato"> Tatsuhiro Sato</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the study, we present a conceptual framework for developing a scheduling system that can generate self-explanatory and easy-understanding schedules. To this end, a user interface is conceived to help planners record factors that are considered crucial in scheduling, as well as internal and external sources relating to such factors. A hybrid approach combining machine learning and constraint programming is developed to generate schedules and the corresponding factors, and accordingly display them on the user interface. Effects of the proposed system on scheduling are discussed, and it is expected that scheduling efficiency and system understandability will be improved, compared with previous scheduling systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constraint%20programming" title="constraint programming">constraint programming</a>, <a href="https://publications.waset.org/abstracts/search?q=factors%20considered%20in%20scheduling" title=" factors considered in scheduling"> factors considered in scheduling</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=scheduling%20system" title=" scheduling system"> scheduling system</a> </p> <a href="https://publications.waset.org/abstracts/43995/towards-developing-a-self-explanatory-scheduling-system-based-on-a-hybrid-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43995.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">465</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">464</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">463</span> A Task Scheduling Algorithm in Cloud Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Bagherinia">Ali Bagherinia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Efficient task scheduling method can meet users' requirements, and improve the resource utilization, then increase the overall performance of the cloud computing environment. Cloud computing has new features, such as flexibility, virtualization and etc., in this paper we propose a two levels task scheduling method based on load balancing in cloud computing. This task scheduling method meet user's requirements and get high resource utilization, that simulation results in CloudSim simulator prove this. <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=task%20scheduling" title=" task scheduling"> task scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=virtualization" title=" virtualization"> virtualization</a>, <a href="https://publications.waset.org/abstracts/search?q=SLA" title=" SLA"> SLA</a> </p> <a href="https://publications.waset.org/abstracts/32451/a-task-scheduling-algorithm-in-cloud-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32451.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">401</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">462</span> Comparative Study of Scheduling Algorithms for LTE Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samia%20Dardouri">Samia Dardouri</a>, <a href="https://publications.waset.org/abstracts/search?q=Ridha%20Bouallegue"> Ridha Bouallegue</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scheduling is the process of dynamically allocating physical resources to User Equipment (UE) based on scheduling algorithms implemented at the LTE base station. Various algorithms have been proposed by network researchers as the implementation of scheduling algorithm which represents an open issue in Long Term Evolution (LTE) standard. This paper makes an attempt to study and compare the performance of PF, MLWDF and EXP/PF scheduling algorithms. The evaluation is considered for a single cell with interference scenario for different flows such as Best effort, Video and VoIP in a pedestrian and vehicular environment using the LTE-Sim network simulator. The comparative study is conducted in terms of system throughput, fairness index, delay, packet loss ratio (PLR) and total cell spectral efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LTE" title="LTE">LTE</a>, <a href="https://publications.waset.org/abstracts/search?q=multimedia%20flows" title=" multimedia flows"> multimedia flows</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling%20algorithms" title=" scheduling algorithms"> scheduling algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20computing" title=" mobile computing"> mobile computing</a> </p> <a href="https://publications.waset.org/abstracts/8094/comparative-study-of-scheduling-algorithms-for-lte-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8094.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">383</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">461</span> The Application of Bayesian Heuristic for Scheduling in Real-Time Private Clouds</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sahar%20Sohrabi">Sahar Sohrabi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The emergence of Cloud data centers has revolutionized the IT industry. Private Clouds in specific provide Cloud services for certain group of customers/businesses. In a real-time private Cloud each task that is given to the system has a deadline that desirably should not be violated. Scheduling tasks in a real-time private CLoud determine the way available resources in the system are shared among incoming tasks. The aim of the scheduling policy is to optimize the system outcome which for a real-time private Cloud can include: energy consumption, deadline violation, execution time and the number of host switches. Different scheduling policies can be used for scheduling. Each lead to a sub-optimal outcome in a certain settings of the system. A Bayesian Scheduling strategy is proposed for scheduling to further improve the system outcome. The Bayesian strategy showed to outperform all selected policies. It also has the flexibility in dealing with complex pattern of incoming task and has the ability to adapt. <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=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=real-time%20private%20cloud" title=" real-time private cloud"> real-time private cloud</a>, <a href="https://publications.waset.org/abstracts/search?q=bayesian" title=" bayesian"> bayesian</a> </p> <a href="https://publications.waset.org/abstracts/38592/the-application-of-bayesian-heuristic-for-scheduling-in-real-time-private-clouds" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38592.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">460</span> A Mixed Integer Linear Programming Model for Container Collection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Van%20Engeland">J. Van Engeland</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Lavigne"> C. Lavigne</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20De%20Jaeger"> S. De Jaeger</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the light of the transition towards a more circular economy, recovery of products, parts or materials will gain in importance. Additionally, the EU proximity principle related to waste management and emissions generated by transporting large amounts of end-of-life products, shift attention to local recovery networks. The Flemish inter-communal cooperation for municipal solid waste management Meetjesland (IVM) is currently investigating the set-up of such a network. More specifically, the network encompasses the recycling of polyvinyl chloride (PVC), which is collected in separate containers. When these containers are full, a truck should transport them to the processor which can recycle the PVC into new products. This paper proposes a model to optimize the container collection. The containers are located at different Civic Amenity sites (CA sites) in a certain region. Since people can drop off their waste at these CA sites, the containers will gradually fill up during a planning horizon. If a certain container is full, it has to be collected and replaced by an empty container. The collected waste is then transported to a single processor. To perform this collection and transportation of containers, the responsible firm has a set of vehicles stationed at a single depot and different personnel crews. A vehicle can load exactly one container. If a trailer is attached to the vehicle, it can load an additional container. Each day of the planning horizon, the different crews and vehicles leave the depot to collect containers at the different sites. After loading one or two containers, the crew has to drive to the processor for unloading the waste and to pick up empty containers. Afterwards, the crew can again visit sites or it can return to the depot to end its collection work for that day. All along the collection process, the crew has to respect the opening hours of the sites. In order to allow for some flexibility, a crew is allowed to wait a certain amount of time at the gate of a site until it opens. The problem described can be modelled as a variant to the PVRP-TW (Periodic Vehicle Routing Problem with Time Windows). However, a vehicle can at maximum load two containers, hence only two subsequent site visits are possible. For that reason, we will refer to the model as a model for building tactical waste collection schemes. The goal is to a find a schedule describing which crew should visit which CA site on which day to minimize the number of trucks and the routing costs. The model was coded in IBM CPLEX Optimization studio and applied to a number of test instances. Good results were obtained, and specific suggestions concerning route and truck costs could be made. For a large range of input parameters, collection schemes using two trucks are obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=container%20collection" title="container collection">container collection</a>, <a href="https://publications.waset.org/abstracts/search?q=crew%20scheduling" title=" crew scheduling"> crew scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20linear%20programming" title=" mixed integer linear programming"> mixed integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=waste%20management" title=" waste management"> waste management</a> </p> <a href="https://publications.waset.org/abstracts/97057/a-mixed-integer-linear-programming-model-for-container-collection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97057.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">134</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">459</span> A Heuristic Approach for the General Flowshop Scheduling Problem to Minimize the Makespan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Ziaee">Mohsen Ziaee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Almost all existing researches on the flowshop scheduling problems focus on the permutation schedules and there is insufficient study dedicated to the general flowshop scheduling problems in the literature, since the modeling and solving of the general flowshop scheduling problems are more difficult than the permutation ones, especially for the large-size problem instances. This paper considers the general flowshop scheduling problem with the objective function of the makespan (F//Cmax). We first find the optimal solution of the problem by solving a mixed integer linear programming model. An efficient heuristic method is then presented to solve the problem. An ant colony optimization algorithm is also proposed for the problem. In order to evaluate the performance of the methods, computational experiments are designed and performed. Numerical results show that the heuristic algorithm can result in reasonable solutions with low computational effort and even achieve optimal solutions in some cases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=scheduling" title="scheduling">scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=general%20flow%20shop%20scheduling%20problem" title=" general flow shop scheduling problem"> general flow shop scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic" title=" heuristic"> heuristic</a> </p> <a href="https://publications.waset.org/abstracts/92277/a-heuristic-approach-for-the-general-flowshop-scheduling-problem-to-minimize-the-makespan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92277.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">207</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">458</span> Examination Scheduling System with Proposed Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tabrej%20Khan">Tabrej Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Examination Scheduling System (ESS) is a scheduling system that targets as an exam committee in any academic institute to help them in managing the exams automatically. We present an algorithm for Examination Scheduling System. Nowadays, many universities have challenges with creating examination schedule fast with less confliction compared to hand works. Our aims are to develop a computerized system that can be used in examination scheduling in an academic institute versus available resources (Time, Hall, Invigilator and instructor) with no contradiction and achieve fairness among students. ESS was developed using HTML, C# language, Crystal Report and ASP.NET through Microsoft Visual Studio 2010 as developing tools with integrated SQL server database. This application can produce some benefits such as reducing the time spent in creating an exam schedule and achieving fairness among students <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=examination%20scheduling%20system%20%28ESS%29" title="examination scheduling system (ESS)">examination scheduling system (ESS)</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithm" title=" algorithm"> algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=ASP.NET" title=" ASP.NET"> ASP.NET</a>, <a href="https://publications.waset.org/abstracts/search?q=crystal%20report" title=" crystal report"> crystal report</a> </p> <a href="https://publications.waset.org/abstracts/62755/examination-scheduling-system-with-proposed-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62755.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">404</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">457</span> Scheduling Algorithm Based on Load-Aware Queue Partitioning in Heterogeneous Multi-Core Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hong%20Kai">Hong Kai</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhong%20Jun%20Jie"> Zhong Jun Jie</a>, <a href="https://publications.waset.org/abstracts/search?q=Chen%20Lin%20Qi"> Chen Lin Qi</a>, <a href="https://publications.waset.org/abstracts/search?q=Wang%20Chen%20Guang"> Wang Chen Guang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are inefficient global scheduling parallelism and local scheduling parallelism prone to processor starvation in current scheduling algorithms. Regarding this issue, this paper proposed a load-aware queue partitioning scheduling strategy by first allocating the queues according to the number of processor cores, calculating the load factor to specify the load queue capacity, and it assigned the awaiting nodes to the appropriate perceptual queues through the precursor nodes and the communication computation overhead. At the same time, real-time computation of the load factor could effectively prevent the processor from being starved for a long time. Experimental comparison with two classical algorithms shows that there is a certain improvement in both performance metrics of scheduling length and task speedup ratio. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=load-aware" title="load-aware">load-aware</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling%20algorithm" title=" scheduling algorithm"> scheduling algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=perceptual%20queue" title=" perceptual queue"> perceptual queue</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20multi-core" title=" heterogeneous multi-core"> heterogeneous multi-core</a> </p> <a href="https://publications.waset.org/abstracts/162110/scheduling-algorithm-based-on-load-aware-queue-partitioning-in-heterogeneous-multi-core-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162110.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">456</span> A Reactive Flexible Job Shop Scheduling Model in a Stochastic Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Majid%20Khalili">Majid Khalili</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamed%20Tayebi"> Hamed Tayebi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers a stochastic flexible job-shop scheduling (SFJSS) problem in the presence of production disruptions, and reactive scheduling is implemented in order to find the optimal solution under uncertainty. In this problem, there are two main disruptions including machine failure which influences operation time, and modification or cancellation of the order delivery date during production. In order to decrease the negative effects of these difficulties, two derived strategies from reactive scheduling are used; the first one is relevant to being able to allocate multiple machine to each job, and the other one is related to being able to select the best alternative process from other job while some disruptions would be created in the processes of a job. For this purpose, a Mixed Integer Linear Programming model is proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flexible%20job-shop%20scheduling" title="flexible job-shop scheduling">flexible job-shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=reactive%20scheduling" title=" reactive scheduling"> reactive scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20environment" title=" stochastic environment"> stochastic environment</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20linear%20programming" title=" mixed integer linear programming"> mixed integer linear programming</a> </p> <a href="https://publications.waset.org/abstracts/69932/a-reactive-flexible-job-shop-scheduling-model-in-a-stochastic-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69932.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">361</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">455</span> Presenting a Job Scheduling Algorithm Based on Learning Automata in Computational Grid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Roshanak%20Khodabakhsh%20Jolfaei">Roshanak Khodabakhsh Jolfaei</a>, <a href="https://publications.waset.org/abstracts/search?q=Javad%20Akbari%20Torkestani"> Javad Akbari Torkestani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As a cooperative environment for problem-solving, it is necessary that grids develop efficient job scheduling patterns with regard to their goals, domains and structure. Since the Grid environments facilitate distributed calculations, job scheduling appears in the form of a critical problem for the management of Grid sources that influences severely on the efficiency for the whole Grid environment. Due to the existence of some specifications such as sources dynamicity and conditions of the network in Grid, some algorithm should be presented to be adjustable and scalable with increasing the network growth. For this purpose, in this paper a job scheduling algorithm has been presented on the basis of learning automata in computational Grid which the performance of its results were compared with FPSO algorithm (Fuzzy Particle Swarm Optimization algorithm) and GJS algorithm (Grid Job Scheduling algorithm). The obtained numerical results indicated the superiority of suggested algorithm in comparison with FPSO and GJS. In addition, the obtained results classified FPSO and GJS in the second and third position respectively after the mentioned algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computational%20grid" title="computational grid">computational grid</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20scheduling" title=" job scheduling"> job scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20automata" title=" learning automata"> learning automata</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20scheduling" title=" dynamic scheduling"> dynamic scheduling</a> </p> <a href="https://publications.waset.org/abstracts/40508/presenting-a-job-scheduling-algorithm-based-on-learning-automata-in-computational-grid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40508.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">343</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">454</span> A Polynomial Approach for a Graphical-based Integrated Production and Transport Scheduling with Capacity Restrictions </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Ndeley">M. Ndeley</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The performance of global manufacturing supply chains depends on the interaction of production and transport processes. Currently, the scheduling of these processes is done separately without considering mutual requirements, which leads to no optimal solutions. An integrated scheduling of both processes enables the improvement of supply chain performance. The integrated production and transport scheduling problem (PTSP) is NP-hard, so that heuristic methods are necessary to efficiently solve large problem instances as in the case of global manufacturing supply chains. This paper presents a heuristic scheduling approach which handles the integration of flexible production processes with intermodal transport, incorporating flexible land transport. The method is based on a graph that allows a reformulation of the PTSP as a shortest path problem for each job, which can be solved in polynomial time. The proposed method is applied to a supply chain scenario with a manufacturing facility in South Africa and shipments of finished product to customers within the Country. The obtained results show that the approach is suitable for the scheduling of large-scale problems and can be flexibly adapted to different scenarios. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=production%20and%20transport%20scheduling%20problem" title="production and transport scheduling problem">production and transport scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20based%20scheduling" title=" graph based scheduling"> graph based scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=integrated%20scheduling" title=" integrated scheduling"> integrated scheduling</a> </p> <a href="https://publications.waset.org/abstracts/30253/a-polynomial-approach-for-a-graphical-based-integrated-production-and-transport-scheduling-with-capacity-restrictions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30253.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">474</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">453</span> Trends in Solving Assembly Job Shop Scheduling Problem: A Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Midhun%20Paul">Midhun Paul</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Radha%20Ramanan"> T. Radha Ramanan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of this work is to present a state-of-the-art literature review highlighting the challenges in the research of the scheduling of assembly job shop problem and providing an insight on how the future directions of the research would be. The number of work has been substantial that it requires a review to enable one to understand the origin of the research and how it is getting evolved. This review paper presents a comprehensive review of the literature dealing with various studies carried on assembly job shop scheduling. The review details the evolution of the AJS from the perspective of other scheduling problems and also presents a classification scheme. The work also identifies the potential directions for future research, which we believe to be worthwhile considering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=assembly%20job%20shop" title="assembly job shop">assembly job shop</a>, <a href="https://publications.waset.org/abstracts/search?q=future%20directions" title=" future directions"> future directions</a>, <a href="https://publications.waset.org/abstracts/search?q=manufacturing" title=" manufacturing"> manufacturing</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a> </p> <a href="https://publications.waset.org/abstracts/2449/trends-in-solving-assembly-job-shop-scheduling-problem-a-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2449.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">413</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">452</span> Resource-Constrained Heterogeneous Workflow Scheduling Algorithms in Heterogeneous Computing Clusters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lei%20Wang">Lei Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jiahao%20Zhou"> Jiahao Zhou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The development of heterogeneous computing clusters provides a strong computility guarantee for large-scale workflows (e.g., scientific computing, artificial intelligence (AI), etc.). However, the tasks within large-scale workflows have also gradually become heterogeneous due to different demands on computing resources, which leads to the addition of a task resource-restricted constraint to the workflow scheduling problem on heterogeneous computing platforms. In this paper, we propose a heterogeneous constrained minimum makespan scheduling algorithm based on the idea of greedy strategy, which provides an efficient solution to the heterogeneous workflow scheduling problem in a heterogeneous platform. In this paper, we test the effectiveness of our proposed scheduling algorithm by randomly generating heterogeneous workflows with heterogeneous computing platform, and the experiments show that our method improves 15.2% over the state-of-the-art methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20computing" title="heterogeneous computing">heterogeneous computing</a>, <a href="https://publications.waset.org/abstracts/search?q=workflow%20scheduling" title=" workflow scheduling"> workflow scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=constrained%20resources" title=" constrained resources"> constrained resources</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20makespan" title=" minimal makespan"> minimal makespan</a> </p> <a href="https://publications.waset.org/abstracts/190199/resource-constrained-heterogeneous-workflow-scheduling-algorithms-in-heterogeneous-computing-clusters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/190199.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">34</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">451</span> Performance Evaluation of Task Scheduling Algorithm on LCQ Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zaki%20Ahmad%20Khan">Zaki Ahmad Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Jamshed%20Siddiqui"> Jamshed Siddiqui</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdus%20Samad"> Abdus Samad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Scheduling and mapping of tasks on a set of processors is considered as a critical problem in parallel and distributed computing system. This paper deals with the problem of dynamic scheduling on a special type of multiprocessor architecture known as Linear Crossed Cube (LCQ) network. This proposed multiprocessor is a hybrid network which combines the features of both linear type of architectures as well as cube based architectures. Two standard dynamic scheduling schemes namely Minimum Distance Scheduling (MDS) and Two Round Scheduling (TRS) schemes are implemented on the LCQ network. Parallel tasks are mapped and the imbalance of load is evaluated on different set of processors in LCQ network. The simulations results are evaluated and effort is made by means of through analysis of the results to obtain the best solution for the given network in term of load imbalance left and execution time. The other performance matrices like speedup and efficiency are also evaluated with the given dynamic algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20algorithm" title="dynamic algorithm">dynamic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20imbalance" title=" load imbalance"> load imbalance</a>, <a href="https://publications.waset.org/abstracts/search?q=mapping" title=" mapping"> mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20scheduling" title=" task scheduling"> task scheduling</a> </p> <a href="https://publications.waset.org/abstracts/20290/performance-evaluation-of-task-scheduling-algorithm-on-lcq-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20290.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">450</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">450</span> Relationship between Relational Energy, Emotional Labour and Cognitive Flexibility of Cabin Crew</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rithi%20Baruah">Rithi Baruah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aviation industry is one such sectors whose primary aim is to work for the safety and comfort of their clients and customers. The crew members in the aviation industry include pilots, flight attendants, air traffic controllers, baggage personnel and maintenance personnel. This study will concentrate on the frontline employees of the aviation industry, the flight attendants. Flight attendants belong to the niche group of population who are paid to smile. Although the profession seems to be very glamorous, it is physically and psychologically very taxing. Energy at workplace is a fairly new concept and is an organizational resource which helps employee attain their goals. Therefore, the researcher will aim to establish the relationship between relational energy and the major issue of emotional labor and cognitive flexibility among flight attendants. The researcher will hypothesize that there will be a negative relationship between relational energy and emotional labour, and a positive relationship between relational energy and cognitive flexibility. Also, a positive relationship will be expected between cognitive flexibility and emotional labour of cabin crew. A quantitative research design will be used to study the relationship among 50 flight attendants in India. The findings of the research will not only help the aviation sector but will be a major contribution to the existing literature of aviation psychology in India which is scanty. The relationships can also provide scope to develop a model using the same. From crew resource management and aviation psychology perspectives, relationships among the study variables will not only provide scope for helping the aviation employees in particular but also develop the performance and safety of aviation sector at large. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cabin%20crew" title="cabin crew">cabin crew</a>, <a href="https://publications.waset.org/abstracts/search?q=cognitive%20flexibility" title=" cognitive flexibility"> cognitive flexibility</a>, <a href="https://publications.waset.org/abstracts/search?q=emotional%20labour" title=" emotional labour"> emotional labour</a>, <a href="https://publications.waset.org/abstracts/search?q=relational%20energy" title=" relational energy"> relational energy</a> </p> <a href="https://publications.waset.org/abstracts/63140/relationship-between-relational-energy-emotional-labour-and-cognitive-flexibility-of-cabin-crew" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63140.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">303</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">449</span> Intelligent Staff Scheduling: Optimizing the Solver with Tabu Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yu-Ping%20Chiu">Yu-Ping Chiu</a>, <a href="https://publications.waset.org/abstracts/search?q=Dung-Ying%20Lin"> Dung-Ying Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traditional staff scheduling methods, relying on employee experience, often lead to inefficiencies and resource waste. The challenges of transferring scheduling expertise and adapting to changing labor regulations further complicate this process. Manual approaches become increasingly impractical as companies accumulate complex scheduling rules over time. This study proposes an algorithmic optimization approach to address these issues, aiming to expedite scheduling while ensuring strict compliance with labor regulations and company policies. The method focuses on generating optimal schedules that minimize weighted company objectives within a compressed timeframe. Recognizing the limitations of conventional commercial software in modeling and solving complex real-world scheduling problems efficiently, this research employs Tabu Search with both long-term and short-term memory structures. The study will present numerical results and managerial insights to demonstrate the effectiveness of this approach in achieving intelligent and efficient staff scheduling. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=intelligent%20memory%20structures" title="intelligent memory structures">intelligent memory structures</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20programming" title=" mixed integer programming"> mixed integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristics" title=" meta-heuristics"> meta-heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=staff%20scheduling%20problem" title=" staff scheduling problem"> staff scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=tabu%20search" title=" tabu search"> tabu search</a> </p> <a href="https://publications.waset.org/abstracts/191996/intelligent-staff-scheduling-optimizing-the-solver-with-tabu-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/191996.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">24</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">448</span> Analysis of Fault Tolerance on Grid Computing in Real Time Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Parampal%20Kaur">Parampal Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=Deepak%20Aggarwal"> Deepak Aggarwal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the computational Grid, fault tolerance is an imperative issue to be considered during job scheduling. Due to the widespread use of resources, systems are highly prone to errors and failures. Hence, fault tolerance plays a key role in the grid to avoid the problem of unreliability. Scheduling the task to the appropriate resource is a vital requirement in computational Grid. The fittest resource scheduling algorithm searches for the appropriate resource based on the job requirements, in contrary to the general scheduling algorithms where jobs are scheduled to the resources with best performance factor. The proposed method is to improve the fault tolerance of the fittest resource scheduling algorithm by scheduling the job in coordination with job replication when the resource has low reliability. Based on the reliability index of the resource, the resource is identified as critical. The tasks are scheduled based on the criticality of the resources. Results show that the execution time of the tasks is comparatively reduced with the proposed algorithm using real-time approach rather than a simulator. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computational%20grid" title="computational grid">computational grid</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20tolerance" title=" fault tolerance"> fault tolerance</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20replication" title=" task replication"> task replication</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20scheduling" title=" job scheduling"> job scheduling</a> </p> <a href="https://publications.waset.org/abstracts/1956/analysis-of-fault-tolerance-on-grid-computing-in-real-time-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1956.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">436</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">447</span> Multishape Task Scheduling Algorithms for Real Time Micro-Controller Based Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ankur%20Jain">Ankur Jain</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20Wilfred%20Godfrey"> W. Wilfred Godfrey</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Embedded systems are usually microcontroller-based systems that represent a class of reliable and dependable dedicated computer systems designed for specific purposes. Micro-controllers are used in most electronic devices in an endless variety of ways. Some micro-controller-based embedded systems are required to respond to external events in the shortest possible time and such systems are known as real-time embedded systems. So in multitasking system there is a need of task Scheduling,there are various scheduling algorithms like Fixed priority Scheduling(FPS),Earliest deadline first(EDF), Rate Monotonic(RM), Deadline Monotonic(DM),etc have been researched. In this Report various conventional algorithms have been reviewed and analyzed, these algorithms consists of single shape task, A new Multishape scheduling algorithms has been proposed and implemented and analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dm" title="dm">dm</a>, <a href="https://publications.waset.org/abstracts/search?q=edf" title=" edf"> edf</a>, <a href="https://publications.waset.org/abstracts/search?q=embedded%20systems" title=" embedded systems"> embedded systems</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20priority" title=" fixed priority"> fixed priority</a>, <a href="https://publications.waset.org/abstracts/search?q=microcontroller" title=" microcontroller"> microcontroller</a>, <a href="https://publications.waset.org/abstracts/search?q=rtos" title=" rtos"> rtos</a>, <a href="https://publications.waset.org/abstracts/search?q=rm" title=" rm"> rm</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling%20algorithms" title=" scheduling algorithms"> scheduling algorithms</a> </p> <a href="https://publications.waset.org/abstracts/30817/multishape-task-scheduling-algorithms-for-real-time-micro-controller-based-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30817.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">403</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">446</span> Metaheuristics to Solve Tasks Scheduling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rachid%20Ziteuni">Rachid Ziteuni</a>, <a href="https://publications.waset.org/abstracts/search?q=Selt%20Omar"> Selt Omar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a new polynomial metaheuristic elaboration (tabu search) for solving scheduling problems. This method allows us to solve the scheduling problem of n tasks on m identical parallel machines with unavailability periods. This problem is NP-complete in the strong sens and finding an optimal solution appears unlikely. Note that all data in this problem are integer and deterministic. The performance criterion to optimize in this problem which we denote Pm/N-c/summs of (wjCj) is the weighted sum of the end dates of tasks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=scheduling" title="scheduling">scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20identical%20machines" title=" parallel identical machines"> parallel identical machines</a>, <a href="https://publications.waset.org/abstracts/search?q=unavailability%20periods" title=" unavailability periods"> unavailability periods</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=tabu%20search" title=" tabu search"> tabu search</a> </p> <a href="https://publications.waset.org/abstracts/5635/metaheuristics-to-solve-tasks-scheduling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5635.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">331</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">445</span> A Performance Analysis of Different Scheduling Schemes in WiMAX</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Youseef">A. Youseef</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the most aims of IEEE 802.16 (WiMAX) is to present high-speed wireless access to cover wide range coverage. The base station (BS) and the subscriber station (SS) are the main parts of WiMAX. WiMAX uses either Point-to-Multipoint (PMP) or mesh topologies. In the PMP mode, the SSs connect to the BS to gain access to the network. However, in the mesh mode, the SSs connect to each other to gain access to the BS. The main components of QoS management in the 802.16 standard are the admission control, buffer management, and packet scheduling. There are several researches proposed to create an efficient packet scheduling schemes. Therefore, we use QualNet 5.0.2 to study the performance of different scheduling schemes, such as WFQ, SCFQ, RR, and SP when the numbers of SSs increase. We find that when the number of SSs increases, the average jitter and average end-to-end delay is increased and the throughput is reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=WiMAX" title="WiMAX">WiMAX</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling%20scheme" title=" scheduling scheme"> scheduling scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=QoS" title=" QoS"> QoS</a>, <a href="https://publications.waset.org/abstracts/search?q=QualNet" title=" QualNet"> QualNet</a> </p> <a href="https://publications.waset.org/abstracts/22519/a-performance-analysis-of-different-scheduling-schemes-in-wimax" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22519.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">456</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">444</span> Optimal Scheduling for Energy Storage System Considering Reliability Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wook-Won%20Kim">Wook-Won Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Je-Seok%20Shin"> Je-Seok Shin</a>, <a href="https://publications.waset.org/abstracts/search?q=Jin-O%20Kim"> Jin-O Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper propose the method for optimal scheduling for battery energy storage system with reliability constraint of energy storage system in reliability aspect. The optimal scheduling problem is solved by dynamic programming with proposed transition matrix. Proposed optimal scheduling method guarantees the minimum fuel cost within specific reliability constraint. For evaluating proposed method, the timely capacity outage probability table (COPT) is used that is calculated by convolution of probability mass function of each generator. This study shows the result of optimal schedule of energy storage system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy%20storage%20system%20%28ESS%29" title="energy storage system (ESS)">energy storage system (ESS)</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20scheduling" title=" optimal scheduling"> optimal scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming" title=" dynamic programming"> dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability%20constraints" title=" reliability constraints"> reliability constraints</a> </p> <a href="https://publications.waset.org/abstracts/39373/optimal-scheduling-for-energy-storage-system-considering-reliability-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39373.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">407</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">443</span> Design and Implementation of Agricultural Machinery Equipment Scheduling Platform Based On Case-Based Reasoning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wen%20Li">Wen Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhengyu%20Bai"> Zhengyu Bai</a>, <a href="https://publications.waset.org/abstracts/search?q=Qi%20Zhang"> Qi Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The demand for smart scheduling platform in agriculture, particularly in the scheduling process of machinery equipment, is high. With the continuous development of agricultural machinery equipment technology, a large number of agricultural machinery equipment and agricultural machinery cooperative service organizations continue to appear in China. The large area of cultivated land and a large number of agricultural activities in the central and western regions of China have made the demand for smart and efficient agricultural machinery equipment scheduling platforms more intense. In this study, we design and implement a platform for agricultural machinery equipment scheduling to allocate agricultural machinery equipment resources reasonably. With agricultural machinery equipment scheduling platform taken as the research object, we discuss its research significance and value, use the service blueprint technology to analyze and characterize the agricultural machinery equipment schedule workflow, the network analytic method to obtain the demand platform function requirements, and divide the platform functions through the platform function division diagram. Simultaneously, based on the case-based reasoning (CBR) algorithm, the equipment scheduling module of the agricultural machinery equipment scheduling platform is realized; finally, a design scheme of the agricultural machinery equipment scheduling platform architecture is provided, and the visualization interface of the platform is established via VB programming language. It provides design ideas and theoretical support for the construction of a modern agricultural equipment information scheduling platform. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=case-based%20reasoning" title="case-based reasoning">case-based reasoning</a>, <a href="https://publications.waset.org/abstracts/search?q=service%20blueprint" title=" service blueprint"> service blueprint</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20design" title=" system design"> system design</a>, <a href="https://publications.waset.org/abstracts/search?q=ANP" title=" ANP"> ANP</a>, <a href="https://publications.waset.org/abstracts/search?q=VB%20programming%20language" title=" VB programming language"> VB programming language</a> </p> <a href="https://publications.waset.org/abstracts/136702/design-and-implementation-of-agricultural-machinery-equipment-scheduling-platform-based-on-case-based-reasoning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136702.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">175</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=crew%20scheduling&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=crew%20scheduling&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=crew%20scheduling&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=crew%20scheduling&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=crew%20scheduling&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=crew%20scheduling&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=crew%20scheduling&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=crew%20scheduling&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=crew%20scheduling&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=crew%20scheduling&page=15">15</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=crew%20scheduling&page=16">16</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=crew%20scheduling&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>