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: optimal scheduling</title> <meta name="description" content="Search results for: optimal scheduling"> <meta name="keywords" content="optimal 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="optimal 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="optimal 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> 3420</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: optimal scheduling</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3420</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">3419</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">3418</span> Operations Research Applications in Audit Planning and Scheduling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdel-Aziz%20M.%20Mohamed">Abdel-Aziz M. Mohamed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a state-of-the-art survey of the operations research models developed for internal audit planning. Two alternative approaches have been followed in the literature for audit planning: (1) identifying the optimal audit frequency; and (2) determining the optimal audit resource allocation. The first approach identifies the elapsed time between two successive audits, which can be presented as the optimal number of audits in a given planning horizon, or the optimal number of transactions after which an audit should be performed. It also includes the optimal audit schedule. The second approach determines the optimal allocation of audit frequency among all auditable units in the firm. In our review, we discuss both the deterministic and probabilistic models developed for audit planning. In addition, game theory models are reviewed to find the optimal auditing strategy based on the interactions between the auditors and the clients. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=operations%20research%20applications" title="operations research applications">operations research applications</a>, <a href="https://publications.waset.org/abstracts/search?q=audit%20frequency" title=" audit frequency"> audit frequency</a>, <a href="https://publications.waset.org/abstracts/search?q=audit-staff%20scheduling" title=" audit-staff scheduling"> audit-staff scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=audit%20planning" title=" audit planning"> audit planning</a> </p> <a href="https://publications.waset.org/abstracts/30968/operations-research-applications-in-audit-planning-and-scheduling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30968.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">815</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">3417</span> Single Machine Scheduling Problem to Minimize the Number of Tardy Jobs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Allahverdi">Ali Allahverdi</a>, <a href="https://publications.waset.org/abstracts/search?q=Harun%20Aydilek"> Harun Aydilek</a>, <a href="https://publications.waset.org/abstracts/search?q=Asiye%20Aydilek"> Asiye Aydilek</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Minimizing the number of tardy jobs is an important factor to consider while making scheduling decisions. This is because on-time shipments are vital for lowering cost and increasing customers’ satisfaction. This paper addresses the single machine scheduling problem with the objective of minimizing the number of tardy jobs. The only known information is the lower and upper bounds for processing times, and deterministic job due dates. A dominance relation is established, and an algorithm is proposed. Several heuristics are generated from the proposed algorithm. Computational analysis indicates that the performance of one of the heuristics is very close to the optimal solution, i.e., on average, less than 1.5 % from the optimal solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=single%20machine%20scheduling" title="single machine scheduling">single machine scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=number%20of%20tardy%20jobs" title=" number of tardy jobs"> number of tardy jobs</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristi" title=" heuristi"> heuristi</a>, <a href="https://publications.waset.org/abstracts/search?q=lower%20and%20upper%20bounds" title=" lower and upper bounds"> lower and upper bounds</a> </p> <a href="https://publications.waset.org/abstracts/21639/single-machine-scheduling-problem-to-minimize-the-number-of-tardy-jobs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21639.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">555</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">3416</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">3415</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">3414</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">3413</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">3412</span> Solving Operating Room Scheduling Problem by Using Dispatching Rule</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yang-Kuei%20Lin">Yang-Kuei Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Yin-Yi%20Chou"> Yin-Yi Chou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this research, we have considered operating room scheduling problem. The objective is to minimize total operating cost. The total operating cost includes idle cost and overtime cost. We have proposed a dispatching rule that can guarantee to find feasible solutions for the studied problem efficiently. We compared the proposed dispatching rule with the optimal solutions found by solving Inter Programming, and other solutions found by using modified existing dispatching rules. The computational results indicates that the proposed heuristic can find near optimal solutions efficiently. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=assignment" title="assignment">assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=dispatching%20rule" title=" dispatching rule"> dispatching rule</a>, <a href="https://publications.waset.org/abstracts/search?q=operation%20rooms" title=" operation rooms"> operation rooms</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a> </p> <a href="https://publications.waset.org/abstracts/91669/solving-operating-room-scheduling-problem-by-using-dispatching-rule" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/91669.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">233</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">3411</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">3410</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">3409</span> Using the SMT Solver to Minimize the Latency and to Optimize the Number of Cores in an NoC-DSP Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Imen%20Amari">Imen Amari</a>, <a href="https://publications.waset.org/abstracts/search?q=Kaouther%20%20Gasmi"> Kaouther Gasmi</a>, <a href="https://publications.waset.org/abstracts/search?q=Asma%20Rebaya"> Asma Rebaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Salem%20Hasnaoui"> Salem Hasnaoui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem of scheduling and mapping data flow applications on multi-core architectures is notoriously difficult. This difficulty is related to the rapid evaluation of Telecommunication and multimedia systems accompanied by a rapid increase of user requirements in terms of latency, execution time, consumption, energy, etc. Having an optimal scheduling on multi-cores DSP (Digital signal Processors) platforms is a challenging task. In this context, we present a novel technic and algorithm in order to find a valid schedule that optimizes the key performance metrics particularly the Latency. Our contribution is based on Satisfiability Modulo Theories (SMT) solving technologies which is strongly driven by the industrial applications and needs. This paper, describe a scheduling module integrated in our proposed Workflow which is advised to be a successful approach for programming the applications based on NoC-DSP platforms. This workflow transform automatically a Simulink model to a synchronous dataflow (SDF) model. The automatic transformation followed by SMT solver scheduling aim to minimize the final latency and other software/hardware metrics in terms of an optimal schedule. Also, finding the optimal numbers of cores to be used. In fact, our proposed workflow taking as entry point a Simulink file (.mdl or .slx) derived from embedded Matlab functions. We use an approach which is based on the synchronous and hierarchical behavior of both Simulink and SDF. Whence, results of running the scheduler which exist in the Workflow mentioned above using our proposed SMT solver algorithm refinements produce the best possible scheduling in terms of latency and numbers of cores. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-cores%20DSP" title="multi-cores DSP">multi-cores DSP</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=SMT%20solver" title=" SMT solver"> SMT solver</a>, <a href="https://publications.waset.org/abstracts/search?q=workflow" title=" workflow"> workflow</a> </p> <a href="https://publications.waset.org/abstracts/67632/using-the-smt-solver-to-minimize-the-latency-and-to-optimize-the-number-of-cores-in-an-noc-dsp-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67632.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">286</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3408</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">3407</span> Effective Scheduling of Hybrid Reconfigurable Microgrids Considering High Penetration of Renewable Sources</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdollah%20Kavousi%20Fard">Abdollah Kavousi Fard</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper addresses the optimal scheduling of hybrid reconfigurable microgrids considering hybrid electric vehicle charging demands. A stochastic framework based on unscented transform to model the high uncertainties of renewable energy sources including wind turbine and photovoltaic panels, as well as the hybrid electric vehicles’ charging demand. In order to get to the optimal scheduling, the network reconfiguration is employed as an effective tool for changing the power supply path and avoiding possible congestions. The simulation results are analyzed and discussed in three different scenarios including coordinated, uncoordinated and smart charging demand of hybrid electric vehicles. A typical grid-connected microgrid is employed to show the satisfying performance of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=microgrid" title="microgrid">microgrid</a>, <a href="https://publications.waset.org/abstracts/search?q=renewable%20energy%20sources" title=" renewable energy sources"> renewable energy sources</a>, <a href="https://publications.waset.org/abstracts/search?q=reconfiguration" title=" reconfiguration"> reconfiguration</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/76987/effective-scheduling-of-hybrid-reconfigurable-microgrids-considering-high-penetration-of-renewable-sources" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76987.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">272</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3406</span> Modeling and Simulation of Flow Shop Scheduling Problem through Petri Net Tools</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Joselito%20Medina%20Marin">Joselito Medina Marin</a>, <a href="https://publications.waset.org/abstracts/search?q=Norberto%20Hern%C3%A1ndez%20Romero"> Norberto Hernández Romero</a>, <a href="https://publications.waset.org/abstracts/search?q=Juan%20Carlos%20Seck%20Tuoh%20Mora"> Juan Carlos Seck Tuoh Mora</a>, <a href="https://publications.waset.org/abstracts/search?q=Erick%20S.%20Martinez%20Gomez"> Erick S. Martinez Gomez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Flow Shop Scheduling Problem (FSSP) is a typical problem that is faced by production planning managers in Flexible Manufacturing Systems (FMS). This problem consists in finding the optimal scheduling to carry out a set of jobs, which are processed in a set of machines or shared resources. Moreover, all the jobs are processed in the same machine sequence. As in all the scheduling problems, the makespan can be obtained by drawing the Gantt chart according to the operations order, among other alternatives. On this way, an FMS presenting the FSSP can be modeled by Petri nets (PNs), which are a powerful tool that has been used to model and analyze discrete event systems. Then, the makespan can be obtained by simulating the PN through the token game animation and incidence matrix. In this work, we present an adaptive PN to obtain the makespan of FSSP by applying PN analytical tools. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flow-shop%20scheduling%20problem" title="flow-shop scheduling problem">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=Petri%20nets" title=" Petri nets"> Petri nets</a>, <a href="https://publications.waset.org/abstracts/search?q=state%20equation" title=" state equation"> state equation</a> </p> <a href="https://publications.waset.org/abstracts/48746/modeling-and-simulation-of-flow-shop-scheduling-problem-through-petri-net-tools" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48746.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">298</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">3405</span> Core Number Optimization Based Scheduler to Order/Mapp Simulink Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Asma%20Rebaya">Asma Rebaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Imen%20Amari"> Imen Amari</a>, <a href="https://publications.waset.org/abstracts/search?q=Kaouther%20Gasmi"> Kaouther Gasmi</a>, <a href="https://publications.waset.org/abstracts/search?q=Salem%20Hasnaoui"> Salem Hasnaoui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Over these last years, the number of cores witnessed a spectacular increase in digital signal and general use processors. Concurrently, significant researches are done to get benefit from the high degree of parallelism. Indeed, these researches are focused to provide an efficient scheduling from hardware/software systems to multicores architecture. The scheduling process consists on statically choose one core to execute one task and to specify an execution order for the application tasks. In this paper, we describe an efficient scheduler that calculates the optimal number of cores required to schedule an application, gives a heuristic scheduling solution and evaluates its cost. Our proposal results are evaluated and compared with Preesm scheduler results and we prove that ours allows better scheduling in terms of latency, computation time and number of cores. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computation%20time" title="computation time">computation time</a>, <a href="https://publications.waset.org/abstracts/search?q=hardware%2Fsoftware%20system" title=" hardware/software system"> hardware/software system</a>, <a href="https://publications.waset.org/abstracts/search?q=latency" title=" latency"> latency</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title="optimization">optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-cores%20platform" title=" multi-cores platform"> multi-cores platform</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a> </p> <a href="https://publications.waset.org/abstracts/67853/core-number-optimization-based-scheduler-to-ordermapp-simulink-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67853.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">283</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">3404</span> A Construction Scheduling Model by Applying Pedestrian and Vehicle Simulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akhmad%20F.%20K.%20Khitam">Akhmad F. K. Khitam</a>, <a href="https://publications.waset.org/abstracts/search?q=Yi%20Tai"> Yi Tai</a>, <a href="https://publications.waset.org/abstracts/search?q=Hsin-Yun%20Lee"> Hsin-Yun Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the modern research of construction management, the goals of scheduling are not only to finish the project within the limited duration, but also to improve the impact of people and environment. Especially for the impact to the pedestrian and vehicles, the considerable social cost should be estimated in the total performance of a construction project. However, the site environment has many differences between projects. These interactions affect the requirement and goal of scheduling. It is difficult for schedule planners to quantify these interactions. Therefore, this study use 3D dynamic simulation technology to plan the schedule of the construction engineering projects that affect the current space users (i.e., the pedestrians and vehicles). The proposed model can help the project manager find out the optimal schedule to minimize the inconvenience brought to the space users. Besides, a roadwork project and a building renovation project were analyzed for the practical situation of engineering and operations. Then this study integrates the proper optimization algorithms and computer technology to establish a decision support model. The proposed model can generate a near-optimal schedule solution for project planners. <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=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=pedestrian%20and%20vehicle%20behavior" title=" pedestrian and vehicle behavior"> pedestrian and vehicle behavior</a> </p> <a href="https://publications.waset.org/abstracts/109961/a-construction-scheduling-model-by-applying-pedestrian-and-vehicle-simulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/109961.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">141</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">3403</span> Optimizing Irrigation Scheduling for Sustainable Agriculture: A Case Study of a Farm in Onitsha, Anambra State, Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ejoh%20Nonso%20Francis">Ejoh Nonso Francis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> : Irrigation scheduling is a critical aspect of sustainable agriculture as it ensures optimal use of water resources, reduces water waste, and enhances crop yields. This paper presents a case study of a farm in Onitsha, Anambra State, Nigeria, where irrigation scheduling was optimized using a combination of soil moisture sensors and weather data. The study aimed to evaluate the effectiveness of this approach in improving water use efficiency and crop productivity. The results showed that the optimized irrigation scheduling approach led to a 30% reduction in water use while increasing crop yield by 20%. The study demonstrates the potential of technology-based irrigation scheduling to enhance sustainable agriculture in Nigeria and beyond. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=irrigation%20scheduling" title="irrigation scheduling">irrigation scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=sustainable%20agriculture" title=" sustainable agriculture"> sustainable agriculture</a>, <a href="https://publications.waset.org/abstracts/search?q=soil%20moisture%20sensors" title=" soil moisture sensors"> soil moisture sensors</a>, <a href="https://publications.waset.org/abstracts/search?q=weather%20data" title=" weather data"> weather data</a>, <a href="https://publications.waset.org/abstracts/search?q=water%20use%20efficiency" title=" water use efficiency"> water use efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=crop%20productivity" title=" crop productivity"> crop productivity</a>, <a href="https://publications.waset.org/abstracts/search?q=nigeria" title=" nigeria"> nigeria</a>, <a href="https://publications.waset.org/abstracts/search?q=onitsha" title=" onitsha"> onitsha</a>, <a href="https://publications.waset.org/abstracts/search?q=anambra%20state" title=" anambra state"> anambra state</a>, <a href="https://publications.waset.org/abstracts/search?q=technology-based%20irrigation%20scheduling" title=" technology-based irrigation scheduling"> technology-based irrigation scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=water%20resources" title=" water resources"> water resources</a>, <a href="https://publications.waset.org/abstracts/search?q=environmental%20degradation" title=" environmental degradation"> environmental degradation</a>, <a href="https://publications.waset.org/abstracts/search?q=crop%20water%20requirements" title=" crop water requirements"> crop water requirements</a>, <a href="https://publications.waset.org/abstracts/search?q=overwatering" title=" overwatering"> overwatering</a>, <a href="https://publications.waset.org/abstracts/search?q=water%20waste" title=" water waste"> water waste</a>, <a href="https://publications.waset.org/abstracts/search?q=farming%20systems" title=" farming systems"> farming systems</a>, <a href="https://publications.waset.org/abstracts/search?q=scalability" title=" scalability"> scalability</a> </p> <a href="https://publications.waset.org/abstracts/165989/optimizing-irrigation-scheduling-for-sustainable-agriculture-a-case-study-of-a-farm-in-onitsha-anambra-state-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/165989.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">78</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">3402</span> A New Mathematical Model for Scheduling Preventive Maintenance and Renewal Projects of Multi-Unit Systems; Application to Railway Track</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Farzad%20Pargar">Farzad Pargar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We introduce the preventive maintenance and renewal scheduling problem for a multi-unit system over a finite and discretized time horizon. Given the latest possible time for carrying out the next maintenance and renewal projects after the previous ones and considering several common set-up costs, the introduced scheduling model tries to minimize the cost of projects by grouping them and simultaneously finding the optimal balance between doing maintenance and renewal. We present a 0-1 pure integer linear programming that determines which projects should be performed together on which location and in which period (e.g., week or month). We consider railway track as a case for our study and test the performance of the proposed model on a set of test problems. The experimental results show that the proposed approach performs well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=maintenance" title="maintenance">maintenance</a>, <a href="https://publications.waset.org/abstracts/search?q=renewal" title=" renewal"> renewal</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20programming%20model" title=" mathematical programming model"> mathematical programming model</a> </p> <a href="https://publications.waset.org/abstracts/26250/a-new-mathematical-model-for-scheduling-preventive-maintenance-and-renewal-projects-of-multi-unit-systems-application-to-railway-track" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26250.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">688</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">3401</span> Optimal Solutions for Real-Time Scheduling of Reconfigurable Embedded Systems Based on Neural Networks with Minimization of Power Consumption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghofrane%20Rehaiem">Ghofrane Rehaiem</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamza%20Gharsellaoui"> Hamza Gharsellaoui</a>, <a href="https://publications.waset.org/abstracts/search?q=Samir%20Benahmed"> Samir Benahmed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, Artificial Neural Networks (ANNs) were used for modeling the parameters that allow the real-time scheduling of embedded systems under resources constraints designed for real-time applications running. The objective of this work is to implement a neural networks based approach for real-time scheduling of embedded systems in order to handle real-time constraints in execution scenarios. In our proposed approach, many techniques have been proposed for both the planning of tasks and reducing energy consumption. In fact, a combination of Dynamic Voltage Scaling (DVS) and time feedback can be used to scale the frequency dynamically adjusting the operating voltage. Indeed, we present in this paper a hybrid contribution that handles the real-time scheduling of embedded systems, low power consumption depending on the combination of DVS and Neural Feedback Scheduling (NFS) with the energy Priority Earlier Deadline First (PEDF) algorithm. Experimental results illustrate the efficiency of our original proposed approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization" title="optimization">optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title=" neural networks"> neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=real-time%20scheduling" title=" real-time scheduling"> real-time scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=low-power%20consumption" title=" low-power consumption"> low-power consumption</a> </p> <a href="https://publications.waset.org/abstracts/64497/optimal-solutions-for-real-time-scheduling-of-reconfigurable-embedded-systems-based-on-neural-networks-with-minimization-of-power-consumption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64497.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">371</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">3400</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">3399</span> An Extended Basic Period and Power-of-Two Policy for Economic Lot-Size Batch-Shipment Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wen-Tsung%20Ho">Wen-Tsung Ho</a>, <a href="https://publications.waset.org/abstracts/search?q=Ku-Kuang%20Chang"> Ku-Kuang Chang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hsin-Yuan%20Chang"> Hsin-Yuan Chang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we consider an economic lot-size batch-shipment scheduling problem (ELBSP) with extended basic period (EBP) and power-of-two (PoT) policies. In this problem, the supplier using a single facility to manufacture multiple products and equally sized batches are then delivered by the supplier to buyers over an infinite planning horizon. Further, the extended basic period (EBP) and power-of-two (PoT) policy are utilized. Relaxing the production schedule converts the ELBSP to an economic lot-size batch-shipment problem (ELBP) with EBP and PoT policies, and a nonlinear integer programming model of the ELBP is constructed. Using the replenishment cycle division and recursive tightening methods, optimal solutions are then solved separately for each product. The sum of these optimal solutions is the lower bound of the ELBSP. A proposed heuristic method with polynomial complexity is then applied to figure out the near-optimal solutions of the ELBSP. Numerical example is presented to confirm the efficacy of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=economic%20lot-size%20scheduling%20problem" title="economic lot-size scheduling problem">economic lot-size scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=extended%20basic%20period" title=" extended basic period"> extended basic period</a>, <a href="https://publications.waset.org/abstracts/search?q=replenishment%20cycle%20division" title=" replenishment cycle division"> replenishment cycle division</a>, <a href="https://publications.waset.org/abstracts/search?q=recursive%20tightening" title=" recursive tightening"> recursive tightening</a>, <a href="https://publications.waset.org/abstracts/search?q=power-of-two" title=" power-of-two"> power-of-two</a> </p> <a href="https://publications.waset.org/abstracts/69870/an-extended-basic-period-and-power-of-two-policy-for-economic-lot-size-batch-shipment-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69870.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">338</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">3398</span> Dynamic Self-Scheduling of Pumped-Storage Power Plant in Energy and Ancillary Service Markets Using Sliding Window Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Kanakasabapathy">P. Kanakasabapathy</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Radhika"> S. Radhika</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the competitive electricity market environment, the profit of the pumped-storage plant in the energy market can be maximized by operating it as a generator, when market clearing price is high and as a pump, to pump water from lower reservoir to upper reservoir, when the price is low. An optimal self-scheduling plan has been developed for a pumped-storage plant, carried out on weekly basis in order to maximize the profit of the plant, keeping into account of all the major uncertainties such as the sudden ancillary service delivery request and the price forecasting errors. For a pumped storage power plant to operate in a real time market successive self-scheduling has to be done by considering the forecast of the day-ahead market and the modified reservoir storage due to the ancillary service request of the previous day. Sliding Window Technique has been used for successive self-scheduling to ensure profit for the plant. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ancillary%20services" title="ancillary services">ancillary services</a>, <a href="https://publications.waset.org/abstracts/search?q=BPSO" title=" BPSO"> BPSO</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20system%20economics" title=" power system economics"> power system economics</a>, <a href="https://publications.waset.org/abstracts/search?q=self-scheduling" title=" self-scheduling"> self-scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=sliding%20window%20technique" title=" sliding window technique"> sliding window technique</a> </p> <a href="https://publications.waset.org/abstracts/7053/dynamic-self-scheduling-of-pumped-storage-power-plant-in-energy-and-ancillary-service-markets-using-sliding-window-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7053.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">3397</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">3396</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">3395</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">3394</span> Scheduling of Cross-Docking Center: An Auction-Based Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eldho%20Paul">Eldho Paul</a>, <a href="https://publications.waset.org/abstracts/search?q=Brijesh%20Paul"> Brijesh Paul</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work proposes an auction mechanism based solution methodology for the optimum scheduling of trucks in a cross-docking centre. The cross-docking centre is an important element of lean supply chain. It reduces the amount of storage and transportation costs in the distribution system compared to an ordinary warehouse. Better scheduling of trucks in a cross-docking center is the best way to reduce storage and transportation costs. Auction mechanism is commonly used for allocation of limited resources in different real-life applications. Here, we try to schedule inbound trucks by integrating auction mechanism with the functioning of a cross-docking centre. A mathematical model is developed for the optimal scheduling of inbound trucks based on the auction methodology. The determination of exact solution for problems involving large number of trucks was found to be computationally difficult, and hence a genetic algorithm based heuristic methodology is proposed in this work. A comparative study of exact and heuristic solutions is done using five classes of data sets. It is observed from the study that the auction-based mechanism is capable of providing good solutions to scheduling problem in cross-docking centres. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=auction%20mechanism" title="auction mechanism">auction mechanism</a>, <a href="https://publications.waset.org/abstracts/search?q=cross-docking%20centre" title=" cross-docking centre"> cross-docking centre</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling%20of%20trucks" title=" scheduling of trucks"> scheduling of trucks</a> </p> <a href="https://publications.waset.org/abstracts/62720/scheduling-of-cross-docking-center-an-auction-based-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62720.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">412</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3393</span> Optimal Scheduling of Trains in Complex National Scale Railway Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sanat%20Ramesh">Sanat Ramesh</a>, <a href="https://publications.waset.org/abstracts/search?q=Tarun%20Dutt"> Tarun Dutt</a>, <a href="https://publications.waset.org/abstracts/search?q=Abhilasha%20Aswal"> Abhilasha Aswal</a>, <a href="https://publications.waset.org/abstracts/search?q=Anushka%20Chandrababu"> Anushka Chandrababu</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20N.%20Srinivasa%20Prasanna"> G. N. Srinivasa Prasanna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Optimal Schedule Generation for a large national railway network operating thousands of passenger trains with tens of thousands of kilometers of track is a grand computational challenge in itself. We present heuristics based on a Mixed Integer Program (MIP) formulation for local optimization. These methods provide flexibility in scheduling new trains with varying speed and delays and improve utilization of infrastructure. We propose methods that provide a robust solution with hundreds of trains being scheduled over a portion of the railway network without significant increases in delay. We also provide techniques to validate the nominal schedules thus generated over global correlated variations in travel times thereby enabling us to detect conflicts arising due to delays. Our validation results which assume only the support of the arrival and departure time distributions takes an order of few minutes for a portion of the network and is computationally efficient to handle the entire network. <p class="card-text"><strong>Keywords:</strong> <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=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=railway%20network" title=" railway network"> railway network</a>, <a href="https://publications.waset.org/abstracts/search?q=train%20scheduling" title=" train scheduling"> train scheduling</a> </p> <a href="https://publications.waset.org/abstracts/91420/optimal-scheduling-of-trains-in-complex-national-scale-railway-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/91420.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">158</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">3392</span> Scheduling Method for Electric Heater in HEMS considering User’s Comfort </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yong-Sung%20Kim">Yong-Sung 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=Ho-Jun%20Jo"> Ho-Jun Jo</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> Home Energy Management System (HEMS) which makes the residential consumers contribute to the demand response is attracting attention in recent years. An aim of HEMS is to minimize their electricity cost by controlling the use of their appliances according to electricity price. The use of appliances in HEMS may be affected by some conditions such as external temperature and electricity price. Therefore, the user’s usage pattern of appliances should be modeled according to the external conditions, and the resultant usage pattern is related to the user’s comfortability on use of each appliances. This paper proposes a methodology to model the usage pattern based on the historical data with the copula function. Through copula function, the usage range of each appliance can be obtained and is able to satisfy the appropriate user’s comfort according to the external conditions for next day. Within the usage range, an optimal scheduling for appliances would be conducted so as to minimize an electricity cost with considering user’s comfort. Among the home appliance, electric heater (EH) is a representative appliance which is affected by the external temperature. In this paper, an optimal scheduling algorithm for an electric heater (EH) is addressed based on the method of branch and bound. As a result, scenarios for the EH usage are obtained according to user’s comfort levels and then the residential consumer would select the best scenario. The case study shows the effects of the proposed algorithm compared with the traditional operation of the EH, and it also represents impacts of the comfort level on the scheduling result. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=load%20scheduling" title="load scheduling">load scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=usage%20pattern" title=" usage pattern"> usage pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=user%E2%80%99s%20comfort" title=" user’s comfort"> user’s comfort</a>, <a href="https://publications.waset.org/abstracts/search?q=copula%20function" title=" copula function"> copula function</a>, <a href="https://publications.waset.org/abstracts/search?q=branch%20and%20bound" title=" branch and bound"> branch and bound</a>, <a href="https://publications.waset.org/abstracts/search?q=electric%20heater" title=" electric heater "> electric heater </a> </p> <a href="https://publications.waset.org/abstracts/39132/scheduling-method-for-electric-heater-in-hems-considering-users-comfort" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39132.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">585</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">3391</span> Scheduling of Repetitive Activities for Height-Rise Buildings: Optimisation by Genetic Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Aljoma">Mohammed Aljoma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a developed prototype for the scheduling of repetitive activities in height-rise buildings was presented. The activities that describe the behavior of the most of activities in multi-storey buildings are scheduled using the developed approach. The prototype combines three methods to attain the optimized planning. The methods include Critical Path Method (CPM), Gantt and Line of Balance (LOB). The developed prototype; POTER is used to schedule repetitive and non-repetitive activities with respect to all constraints that can be automatically generated using a generic database. The prototype uses the method of genetic algorithms for optimizing the planning process. As a result, this approach enables contracting organizations to evaluate various planning solutions that are calculated, tested and classified by POTER to attain an optimal time-cost equilibrium according to their own criteria of time or coast. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=planning%20scheduling" title="planning scheduling">planning scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithms" title=" genetic algorithms"> genetic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=repetitive%20activity" title=" repetitive activity"> repetitive activity</a>, <a href="https://publications.waset.org/abstracts/search?q=construction%20management" title=" construction management"> construction management</a>, <a href="https://publications.waset.org/abstracts/search?q=planning" title=" planning"> planning</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=risk%20management" title=" risk management"> risk management</a>, <a href="https://publications.waset.org/abstracts/search?q=project%20duration" title=" project duration"> project duration</a> </p> <a href="https://publications.waset.org/abstracts/42082/scheduling-of-repetitive-activities-for-height-rise-buildings-optimisation-by-genetic-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42082.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">308</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=optimal%20scheduling&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20scheduling&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20scheduling&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20scheduling&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20scheduling&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20scheduling&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20scheduling&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20scheduling&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%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=optimal%20scheduling&page=113">113</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20scheduling&page=114">114</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%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>