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: minimal makespan</title> <meta name="description" content="Search results for: minimal makespan"> <meta name="keywords" content="minimal makespan"> <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="minimal makespan" 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="minimal makespan"> <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> 894</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: minimal makespan</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">894</span> Optimization of Flexible Job Shop Scheduling Problem with Sequence-Dependent Setup Times Using Genetic Algorithm Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sanjay%20Kumar%20Parjapati">Sanjay Kumar Parjapati</a>, <a href="https://publications.waset.org/abstracts/search?q=Ajai%20Jain"> Ajai Jain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents optimization of makespan for ‘n’ jobs and ‘m’ machines flexible job shop scheduling problem with sequence dependent setup time using genetic algorithm (GA) approach. A restart scheme has also been applied to prevent the premature convergence. Two case studies are taken into consideration. Results are obtained by considering crossover probability (pc = 0.85) and mutation probability (pm = 0.15). Five simulation runs for each case study are taken and minimum value among them is taken as optimal makespan. Results indicate that optimal makespan can be achieved with more than one sequence of jobs in a production order. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flexible%20job%20shop" title="flexible job shop">flexible job shop</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=makespan" title=" makespan"> makespan</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence%20dependent%20setup%20times" title=" sequence dependent setup times"> sequence dependent setup times</a> </p> <a href="https://publications.waset.org/abstracts/17085/optimization-of-flexible-job-shop-scheduling-problem-with-sequence-dependent-setup-times-using-genetic-algorithm-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17085.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">332</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">893</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">892</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">891</span> Self-Organization-Based Approach for Embedded Real-Time System Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20S.%20Bendib">S. S. Bendib</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20W.%20Mouss"> L. W. Mouss</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Kalla"> S. Kalla</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a self-organization-based approach for real-time systems design. The addressed issue is the mapping of an application onto an architecture of heterogeneous processors while optimizing both makespan and reliability. Since this problem is NP-hard, a heuristic algorithm is used to obtain efficiently approximate solutions. The proposed approach takes into consideration the quality as well as the diversity of solutions. Indeed, an alternate treatment of the two objectives allows to produce solutions of good quality while a self-organization approach based on the neighborhood structure is used to reorganize solutions and consequently to enhance their diversity. Produced solutions make different compromises between the makespan and the reliability giving the user the possibility to select the solution suited to his (her) needs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=embedded%20real-time%20systems%20design" title="embedded real-time systems design">embedded real-time systems design</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability" title=" reliability"> reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=self-organization" title=" self-organization"> self-organization</a>, <a href="https://publications.waset.org/abstracts/search?q=compromises" title=" compromises"> compromises</a> </p> <a href="https://publications.waset.org/abstracts/134093/self-organization-based-approach-for-embedded-real-time-system-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/134093.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">890</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">889</span> Solution Approaches for Some Scheduling Problems with Learning Effect and Job Dependent Delivery Times</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Duran%20Toksari">M. Duran Toksari</a>, <a href="https://publications.waset.org/abstracts/search?q=Berrin%20Ucarkus"> Berrin Ucarkus</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose two algorithms to optimally solve makespan and total completion time scheduling problems with learning effect and job dependent delivery times in a single machine environment. The delivery time is the extra time to eliminate adverse effect between the main processing and delivery to the customer. In this paper, we introduce the job dependent delivery times for some single machine scheduling problems with position dependent learning effect, which are makespan are total completion. The results with respect to two algorithms proposed for solving of the each problem are compared with LINGO solutions for 50-jobs, 100-jobs and 150-jobs problems. The proposed algorithms can find the same results in shorter time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=delivery%20Times" title="delivery Times">delivery Times</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20effect" title=" learning effect"> learning effect</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=total%20completion%20time" title=" total completion time"> total completion time</a> </p> <a href="https://publications.waset.org/abstracts/35711/solution-approaches-for-some-scheduling-problems-with-learning-effect-and-job-dependent-delivery-times" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35711.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">469</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">888</span> A General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=G.%20M.%20Komaki">G. M. Komaki</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Mobin"> S. Mobin</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Teymourian"> E. Teymourian</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Sheikh"> S. Sheikh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attention and due to NP-Hard nature of the problem, metaheuristic algorithms have been proposed to tackle it. Majority of the proposed algorithms require large computational time which is the main drawback. In this study, a general variable neighborhood search algorithm (GVNS) is proposed where several time-saving schemes have been incorporated into it. Also, the GVNS uses the sophisticated method to change the shaking procedure or perturbation depending on the progress of the incumbent solution to prevent stagnation of the search. The performance of the proposed algorithm is compared to the state-of-the-art algorithms based on standard benchmark instances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20permutation%20flow%20shop" title="distributed permutation flow shop">distributed permutation flow shop</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a>, <a href="https://publications.waset.org/abstracts/search?q=general%20variable%20neighborhood%20search%20algorithm" title=" general variable neighborhood search algorithm"> general variable neighborhood search algorithm</a> </p> <a href="https://publications.waset.org/abstracts/37025/a-general-variable-neighborhood-search-algorithm-to-minimize-makespan-of-the-distributed-permutation-flowshop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37025.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">887</span> Minimizing Total Completion Time in No-Wait Flowshops with Setup Times</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> </p> <p class="card-text"><strong>Abstract:</strong></p> The m-machine no-wait flowshop scheduling problem is addressed in this paper. The objective is to minimize total completion time subject to the constraint that the makespan value is not greater than a certain value. Setup times are treated as separate from processing times. Several recent algorithms are adapted and proposed for the problem. An extensive computational analysis has been conducted for the evaluation of the proposed algorithms. The computational analysis indicates that the best proposed algorithm performs significantly better than the earlier existing best algorithm. <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=no-wait%20flowshop" title=" no-wait flowshop"> no-wait flowshop</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithm" title=" algorithm"> algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=setup%20times" title=" setup times"> setup times</a>, <a href="https://publications.waset.org/abstracts/search?q=total%20completion%20time" title=" total completion time"> total completion time</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan "> makespan </a> </p> <a href="https://publications.waset.org/abstracts/4858/minimizing-total-completion-time-in-no-wait-flowshops-with-setup-times" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4858.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">340</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">886</span> Soap Film Enneper Minimal Surface Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yee%20Hooi%20Min">Yee Hooi Min</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohdnasir%20Abdul%20Hadi"> Mohdnasir Abdul Hadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Tensioned membrane structure in the form of Enneper minimal surface can be considered as a sustainable development for the green environment and technology, it also can be used to support the effectiveness used of energy and the structure. Soap film in the form of Enneper minimal surface model has been studied. The combination of shape and internal forces for the purpose of stiffness and strength is an important feature of membrane surface. For this purpose, form-finding using soap film model has been carried out for Enneper minimal surface models with variables u=v=0.6 and u=v=1.0. Enneper soap film models with variables u=v=0.6 and u=v=1.0 provides an alternative choice for structural engineers to consider the tensioned membrane structure in the form of Enneper minimal surface applied in the building industry. It is expected to become an alternative building material to be considered by the designer. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Enneper" title="Enneper">Enneper</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20surface" title=" minimal surface"> minimal surface</a>, <a href="https://publications.waset.org/abstracts/search?q=soap%20film" title=" soap film"> soap film</a>, <a href="https://publications.waset.org/abstracts/search?q=tensioned%20membrane%20structure" title=" tensioned membrane structure"> tensioned membrane structure</a> </p> <a href="https://publications.waset.org/abstracts/20780/soap-film-enneper-minimal-surface-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20780.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">553</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">885</span> An Improved Lower Bound for Minimal-Area Convex Cover for Closed Unit Curves</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Som-Am">S. Som-Am</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Grechuk"> B. Grechuk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Moser’s worm problem is the unsolved problem in geometry which asks for the minimal area of a convex region on the plane which can cover all curves of unit length, assuming that curves may be rotated and translated to fit inside the region. We study a version of this problem asking for a minimal convex cover for closed unit curves. By combining geometric methods with numerical box’s search algorithm, we show that any such cover should have an area at least 0.0975. This improves the best previous lower bound of 0.096694. In fact, we show that the minimal area of convex hull of circle, equilateral triangle, and rectangle of perimeter 1 is between 0.0975 and 0.09763. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Moser%E2%80%99s%20worm%20problem" title="Moser’s worm problem">Moser’s worm problem</a>, <a href="https://publications.waset.org/abstracts/search?q=closed%20arcs" title=" closed arcs"> closed arcs</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20cover" title=" convex cover"> convex cover</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal-area%20cover" title=" minimal-area cover"> minimal-area cover</a> </p> <a href="https://publications.waset.org/abstracts/92526/an-improved-lower-bound-for-minimal-area-convex-cover-for-closed-unit-curves" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92526.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">211</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">884</span> Mobile Agents-Based Framework for Dynamic Resource Allocation in Cloud Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safia%20Rabaaoui">Safia Rabaaoui</a>, <a href="https://publications.waset.org/abstracts/search?q=H%C3%A9la%20Hachicha"> Héla Hachicha</a>, <a href="https://publications.waset.org/abstracts/search?q=Ezzeddine%20Zagrouba"> Ezzeddine Zagrouba</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, cloud computing is becoming the more popular technology to various companies and consumers, which benefit from its increased efficiency, cost optimization, data security, unlimited storage capacity, etc. One of the biggest challenges of cloud computing is resource allocation. Its efficiency directly influences the performance of the whole cloud environment. Finding an effective method to address these critical issues and increase cloud performance was necessary. This paper proposes a mobile agents-based framework for dynamic resource allocation in cloud computing to minimize both the cost of using virtual machines and the makespan. Furthermore, its impact on the best response time and power consumption has been studied. The simulation showed that our method gave better results than here. <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=multi-agent%20system" title=" multi-agent system"> multi-agent system</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20agent" title=" mobile agent"> mobile agent</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20resource%20allocation" title=" dynamic resource allocation"> dynamic resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=cost" title=" cost"> cost</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a> </p> <a href="https://publications.waset.org/abstracts/168460/mobile-agents-based-framework-for-dynamic-resource-allocation-in-cloud-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168460.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">103</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">883</span> A Mixed Integer Linear Programming Model for Flexible Job Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Ziaee">Mohsen Ziaee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a mixed integer linear programming (MILP) model is presented to solve the flexible job shop scheduling problem (FJSP). This problem is one of the hardest combinatorial problems. The objective considered is the minimization of the makespan. The computational results of the proposed MILP model were compared with those of the best known mathematical model in the literature in terms of the computational time. The results show that our model has better performance with respect to all the considered performance measures including relative percentage deviation (RPD) value, number of constraints, and total number of variables. By this improved mathematical model, larger FJS problems can be optimally solved in reasonable time, and therefore, the model would be a better tool for the performance evaluation of the approximation algorithms developed for the problem. <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=flexible%20job%20shop" title=" flexible job shop"> flexible job shop</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</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/92281/a-mixed-integer-linear-programming-model-for-flexible-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92281.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">186</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">882</span> Load Balancing and Resource Utilization in Cloud Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gagandeep%20Kaur">Gagandeep Kaur</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud computing uses various computing resources such as CPU, memory, processor etc. which is used to deliver service over the network and is one of the emerging fields for large scale distributed computing. In cloud computing, execution of large number of tasks with available resources to achieve high performance, minimal total time for completion, minimum response time, effective utilization of resources etc. are the major research areas. In the proposed research, an algorithm has been proposed to achieve high performance in load balancing and resource utilization. The proposed algorithm is used to reduce the makespan, increase the resource utilization and performance cost for independent tasks. Further scheduling metrics based on algorithm in cloud computing has been proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=resource%20utilization" title="resource utilization">resource utilization</a>, <a href="https://publications.waset.org/abstracts/search?q=response%20time" title=" response time"> response time</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20cost" title=" performance cost"> performance cost</a> </p> <a href="https://publications.waset.org/abstracts/140764/load-balancing-and-resource-utilization-in-cloud-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/140764.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">182</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">881</span> Multi-Objective Variable Neighborhood Search Algorithm to Solving Scheduling Problem with Transportation Times</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> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presents a new multi-objective variable neighborhood algorithm (MOVNS). A set of experimental instances are carried out to evaluate the algorithm by advanced multi-objective performance measures. The algorithm is carefully evaluated for its performance against available algorithm by means of multi-objective performance measures and statistical tools. The related results show that a variant of our proposed MOVNS provides sound performance comparing with other algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=no-wait%20hybrid%20flowshop%20scheduling%3B%20multi-objective%20variable%20neighborhood%20algorithm%3B%20makespan%3B%20total%20weighted%20tardiness" title="no-wait hybrid flowshop scheduling; multi-objective variable neighborhood algorithm; makespan; total weighted tardiness">no-wait hybrid flowshop scheduling; multi-objective variable neighborhood algorithm; makespan; total weighted tardiness</a> </p> <a href="https://publications.waset.org/abstracts/15098/multi-objective-variable-neighborhood-search-algorithm-to-solving-scheduling-problem-with-transportation-times" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15098.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">418</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">880</span> An Improved Approach Based on MAS Architecture and Heuristic Algorithm for Systematic Maintenance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdelhadi%20Adel">Abdelhadi Adel</a>, <a href="https://publications.waset.org/abstracts/search?q=Kadri%20Ouahab"> Kadri Ouahab</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes an improved approach based on MAS Architecture and Heuristic Algorithm for systematic maintenance to minimize makespan. We have implemented a problem-solving approach for optimizing the processing time, methods based on metaheuristics. The proposed approach is inspired by the behavior of the human body. This hybridization is between a multi-agent system and inspirations of the human body, especially genetics. The effectiveness of our approach has been demonstrated repeatedly in this paper. To solve such a complex problem, we proposed an approach which we have used advanced operators such as uniform crossover set and single point mutation. The proposed approach is applied to three preventive maintenance policies. These policies are intended to maximize the availability or to maintain a minimum level of reliability during the production chain. The results show that our algorithm outperforms existing algorithms. We assumed that the machines might be unavailable periodically during the production scheduling. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-agent%20systems" title="multi-agent systems">multi-agent systems</a>, <a href="https://publications.waset.org/abstracts/search?q=emergence" title=" emergence"> emergence</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=makespan" title=" makespan"> makespan</a>, <a href="https://publications.waset.org/abstracts/search?q=systematic%20maintenance" title=" systematic maintenance"> systematic maintenance</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20flow%20shop%20scheduling" title=" hybrid flow shop scheduling"> hybrid flow shop scheduling</a> </p> <a href="https://publications.waset.org/abstracts/69375/an-improved-approach-based-on-mas-architecture-and-heuristic-algorithm-for-systematic-maintenance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69375.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">301</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">879</span> Understanding Relationships between Listening to Music and Pronunciation Learning: An Investigation Based upon Japanese EFL Learners' Self-Evaluation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hirokatsu%20Kawashima">Hirokatsu Kawashima</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In an attempt to elucidate relationships between listening to music and pronunciation learning, a classroom-based investigation was conducted with Japanese EFL learners (n=45). The subjects were instructed to listen to English songs they liked on YouTube, especially paying attention to phonologically similar vowel and consonant minimal pair words (e.g., live and leave). This kind of activity, which included taking notes, was regularly carried out in the classroom, and the same kind of task was given to the subjects as homework in order to reinforce the in-class activity. The duration of these activities was eight weeks, after which the program was evaluated on a 9-point scale (1: the lowest and 9: the highest) by learners’ self-evaluation. The main questions for this evaluation included 1) how good the learners had been at pronouncing vowel and consonant minimal pair words originally, 2) how often they had listened to songs good for pronouncing vowel and consonant minimal pair words, 3) how frequently they had moved their mouths to vowel and consonant minimal pair words of English songs, and 4) how much they thought the program would support and enhance their pronunciation learning of phonologically similar vowel and consonant minimal pair words. It has been found, for example, A) that the evaluation of this program is by no means low (Mean: 6.51 and SD: 1.23), suggesting that listening to music may support and enhance pronunciation learning, and B) that listening to consonant minimal pair words in English songs and moving the mouth to them are more related to the program’s evaluation (r =.69, p=.00 and r =.55, p=.00, respectively) than listening to vowel minimal pair words in English songs and moving the mouth to them (r =.45, p=.00 and r =.39, p=.01, respectively). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=minimal%20pair" title="minimal pair">minimal pair</a>, <a href="https://publications.waset.org/abstracts/search?q=music" title=" music"> music</a>, <a href="https://publications.waset.org/abstracts/search?q=pronunciation" title=" pronunciation"> pronunciation</a>, <a href="https://publications.waset.org/abstracts/search?q=song" title=" song"> song</a> </p> <a href="https://publications.waset.org/abstracts/7949/understanding-relationships-between-listening-to-music-and-pronunciation-learning-an-investigation-based-upon-japanese-efl-learners-self-evaluation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7949.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">319</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">878</span> Benders Decomposition Approach to Solve the Hybrid Flow Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ebrahim%20Asadi-Gangraj">Ebrahim Asadi-Gangraj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hybrid flow shop scheduling problem (HFS) contains sequencing in a flow shop where, at any stage, there exist one or more related or unrelated parallel machines. This production system is a common manufacturing environment in many real industries, such as the steel manufacturing, ceramic tile manufacturing, and car assembly industries. In this research, a mixed integer linear programming (MILP) model is presented for the hybrid flow shop scheduling problem, in which, the objective consists of minimizing the maximum completion time (makespan). For this purpose, a Benders Decomposition (BD) method is developed to solve the research problem. The proposed approach is tested on some test problems, small to moderate scale. The experimental results show that the Benders decomposition approach can solve the hybrid flow shop scheduling problem in a reasonable time, especially for small and moderate-size test problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hybrid%20flow%20shop" title="hybrid flow shop">hybrid flow shop</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=Benders%20decomposition" title=" Benders decomposition"> Benders decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a> </p> <a href="https://publications.waset.org/abstracts/106041/benders-decomposition-approach-to-solve-the-hybrid-flow-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/106041.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">188</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">877</span> Effect of Phonological Complexity in Children with Specific Language Impairment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Irfana%20M.">Irfana M.</a>, <a href="https://publications.waset.org/abstracts/search?q=Priyandi%20Kabasi"> Priyandi Kabasi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Children with specific language impairment (SLI) have difficulty acquiring and using language despite having all the requirements of cognitive skills to support language acquisition. These children have normal non-verbal intelligence, hearing, and oral-motor skills, with no history of social/emotional problems or significant neurological impairment. Nevertheless, their language acquisition lags behind their peers. Phonological complexity can be considered to be the major factor that causes the inaccurate production of speech in this population. However, the implementation of various ranges of complex phonological stimuli in the treatment session of SLI should be followed for a better prognosis of speech accuracy. Hence there is a need to study the levels of phonological complexity. The present study consisted of 7 individuals who were diagnosed with SLI and 10 developmentally normal children. All of them were Hindi speakers with both genders and their age ranged from 4 to 5 years. There were 4 sets of stimuli; among them were minimal contrast vs maximal contrast nonwords, minimal coarticulation vs maximal coarticulation nonwords, minimal contrast vs maximal contrast words and minimal coarticulation vs maximal coarticulation words. Each set contained 10 stimuli and participants were asked to repeat each stimulus. Results showed that production of maximal contrast was significantly accurate, followed by minimal coarticulation, minimal contrast and maximal coarticulation. A similar trend was shown for both word and non-word categories of stimuli. The phonological complexity effect was evident in the study for each participant group. Moreover, present study findings can be implemented for the management of SLI, specifically for the selection of stimuli. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coarticulation" title="coarticulation">coarticulation</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20contrast" title=" minimal contrast"> minimal contrast</a>, <a href="https://publications.waset.org/abstracts/search?q=phonological%20complexity" title=" phonological complexity"> phonological complexity</a>, <a href="https://publications.waset.org/abstracts/search?q=specific%20language%20impairment" title=" specific language impairment"> specific language impairment</a> </p> <a href="https://publications.waset.org/abstracts/146147/effect-of-phonological-complexity-in-children-with-specific-language-impairment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/146147.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">142</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">876</span> An Efficient Hybrid Approach Based on Multi-Agent System and Emergence Method for the Integration of Systematic Preventive Maintenance Policies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdelhadi%20Adel">Abdelhadi Adel</a>, <a href="https://publications.waset.org/abstracts/search?q=Kadri%20Ouahab"> Kadri Ouahab</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a hybrid algorithm for the integration of systematic preventive maintenance policies in hybrid flow shop scheduling to minimize makespan. We have implemented a problem-solving approach for optimizing the processing time, methods based on metaheuristics. The proposed approach is inspired by the behavior of the human body. This hybridization is between a multi-agent system and inspirations of the human body, especially genetics. The effectiveness of our approach has been demonstrated repeatedly in this paper. To solve such a complex problem, we proposed an approach which we have used advanced operators such as uniform crossover set and single point mutation. The proposed approach is applied to three preventive maintenance policies. These policies are intended to maximize the availability or to maintain a minimum level of reliability during the production chain. The results show that our algorithm outperforms existing algorithms. We assumed that the machines might be unavailable periodically during the production scheduling. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-agent%20systems" title="multi-agent systems">multi-agent systems</a>, <a href="https://publications.waset.org/abstracts/search?q=emergence" title=" emergence"> emergence</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=makespan" title=" makespan"> makespan</a>, <a href="https://publications.waset.org/abstracts/search?q=systematic%20maintenance" title=" systematic maintenance"> systematic maintenance</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20flow%20shop%20scheduling" title=" hybrid flow shop scheduling"> hybrid flow shop scheduling</a> </p> <a href="https://publications.waset.org/abstracts/46553/an-efficient-hybrid-approach-based-on-multi-agent-system-and-emergence-method-for-the-integration-of-systematic-preventive-maintenance-policies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46553.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">336</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">875</span> Number of Necessary Parameters for Parametrization of Stabilizing Controllers for two times two RHinf Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kazuyoshi%20Mori">Kazuyoshi Mori</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider the number of parameters for the parametrization of stabilizing controllers for RHinf systems with size 2 × 2. Fortunately, any plant of this model can admit doubly coprime factorization. Thus we can use the Youla parameterization to parametrize the stabilizing contollers . However, Youla parameterization does not give itself the minimal number of parameters. This paper shows that the minimal number of parameters is four. As a result, we show that the Youla parametrization naturally gives the parameterization of stabilizing controllers with minimal numbers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=RHinfo" title="RHinfo">RHinfo</a>, <a href="https://publications.waset.org/abstracts/search?q=parameterization" title=" parameterization"> parameterization</a>, <a href="https://publications.waset.org/abstracts/search?q=number%20of%20parameters" title=" number of parameters"> number of parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-input" title=" multi-input"> multi-input</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-output%20systems" title=" multi-output systems"> multi-output systems</a> </p> <a href="https://publications.waset.org/abstracts/33703/number-of-necessary-parameters-for-parametrization-of-stabilizing-controllers-for-two-times-two-rhinf-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33703.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">874</span> Restoring Sagging Neck with Minimal Scar Face Lifting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alessandro%20Marano">Alessandro Marano</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The author describes the use of deep plane face lifting and platysmaplasty to treat sagging neck with minimal scars. Series of case study. The author uses a selective deep plane face lift with a minimal access scar that not extend behind the ear lobe, neck liposuction and platysmaplasty to restore the sagging neck; the scars are minimal and no require drainage post-op. The deep plane face lifting can achieve a good result restoring vertical vectors in aging and sagging face, neck district can be treated without cutting the skin behind the ear lobe combining the SMAS vertical suspension and platysmaplasty; surgery can be performed in local anesthesia with sedation in day surgery and fast recovery. Restoring neck sagging without extend scars behind ear lobe is possible in selected patients, procedure is fast, safe, no drainage required, patients are satisfied and healing time is fast and comfortable. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=face%20lifting" title="face lifting">face lifting</a>, <a href="https://publications.waset.org/abstracts/search?q=aesthetic" title=" aesthetic"> aesthetic</a>, <a href="https://publications.waset.org/abstracts/search?q=face" title=" face"> face</a>, <a href="https://publications.waset.org/abstracts/search?q=neck" title=" neck"> neck</a>, <a href="https://publications.waset.org/abstracts/search?q=platysmaplasty" title=" platysmaplasty"> platysmaplasty</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20plane" title=" deep plane"> deep plane</a> </p> <a href="https://publications.waset.org/abstracts/149687/restoring-sagging-neck-with-minimal-scar-face-lifting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/149687.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">101</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">873</span> Algorithmic Fault Location in Complex Gas Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Soban%20Najam">Soban Najam</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20M.%20Jahanzeb"> S. M. Jahanzeb</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Sohail"> Ahmed Sohail</a>, <a href="https://publications.waset.org/abstracts/search?q=Faraz%20Idris%20Khan"> Faraz Idris Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the recent increase in reliance on Gas as the primary source of energy across the world, there has been a lot of research conducted on gas distribution networks. As the complexity and size of these networks grow, so does the leakage of gas in the distribution network. One of the most crucial factors in the production and distribution of gas is UFG or Unaccounted for Gas. The presence of UFG signifies that there is a difference between the amount of gas distributed, and the amount of gas billed. Our approach is to use information that we acquire from several specified points in the network. This information will be used to calculate the loss occurring in the network using the developed algorithm. The Algorithm can also identify the leakages at any point of the pipeline so we can easily detect faults and rectify them within minimal time, minimal efforts and minimal resources. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=FLA" title="FLA">FLA</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20location%20analysis" title=" fault location analysis"> fault location analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=GDN" title=" GDN"> GDN</a>, <a href="https://publications.waset.org/abstracts/search?q=gas%20distribution%20network" title=" gas distribution network"> gas distribution network</a>, <a href="https://publications.waset.org/abstracts/search?q=GIS" title=" GIS"> GIS</a>, <a href="https://publications.waset.org/abstracts/search?q=geographic%20information%20system" title=" geographic information system"> geographic information system</a>, <a href="https://publications.waset.org/abstracts/search?q=NMS" title=" NMS"> NMS</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20Management%20system" title=" network Management system"> network Management system</a>, <a href="https://publications.waset.org/abstracts/search?q=OMS" title=" OMS"> OMS</a>, <a href="https://publications.waset.org/abstracts/search?q=outage%20management%20system" title=" outage management system"> outage management system</a>, <a href="https://publications.waset.org/abstracts/search?q=SSGC" title=" SSGC"> SSGC</a>, <a href="https://publications.waset.org/abstracts/search?q=Sui%20Southern%20gas%20company" title=" Sui Southern gas company"> Sui Southern gas company</a>, <a href="https://publications.waset.org/abstracts/search?q=UFG" title=" UFG"> UFG</a>, <a href="https://publications.waset.org/abstracts/search?q=unaccounted%20for%20gas" title=" unaccounted for gas"> unaccounted for gas</a> </p> <a href="https://publications.waset.org/abstracts/34657/algorithmic-fault-location-in-complex-gas-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34657.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">626</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">872</span> Minimal Invasive Esophagectomy for Esophageal Cancer: An Institutional Review From a Dedicated Centre of Pakistan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nighat%20Bakhtiar">Nighat Bakhtiar</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Raza%20Khan"> Ali Raza Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Shahid%20Khan%20Khattak"> Shahid Khan Khattak</a>, <a href="https://publications.waset.org/abstracts/search?q=Aamir%20Ali%20Syed"> Aamir Ali Syed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Introduction: Chemoradiation followed by resection has been the standard therapy for resectable (cT1-4aN0-3M0) esophageal carcinoma. The optimal surgical approach remains a matter of debate. Therefore, the purpose of this study was to share our experiences of minimal invasive esophagectomies concerning morbidity, mortality and oncological quality. This study aims to enlighten the world about the surgical outcomes after minimally invasive esophagectomy at Shaukat Khanum Hospital Lahore. Objective: The purpose of this study is to review an institutional experience of Surgical outcomes of Minimal Invasive esophagectomies for esophageal cancer. Methodology: This retrospective study was performed after ethical approval at Shaukat Khanum Memorial Cancer Hospital and Research Centre (SKMCH&RC) Pakistan. Patients who underwent Minimal Invasive esophagectomies for esophageal cancer from March 2018 to March 2023 were selected. Data was collected through the human information system (HIS) electronic database of SKMCH&RC. Data was described using mean and median with minimum and maximum values for quantitative variables. For categorical variables, a number of observations and percentages were reported. Results: A total of 621 patients were included in the study, with the mean age of the patient was 39 years, ranging between 18-58 years. Mean Body Mass Index of patients was 21.2.1±4.1. Neo-adjuvant chemoradiotherapy was given to all patients. The mean operative time was 210.36 ± 64.51 minutes, and the mean blood loss was 121 milliliters. There was one mortality in 90 days, while the mean postoperative hospital stay was 6.58 days with a 4.64 standard deviation. The anastomotic leak rate was 4.2%. Chyle leak was observed in 12 patients. Conclusion: The minimal invasive technique is a safe approach for esophageal cancers, with minimal complications and fast recovery. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=minimal%20invasive" title="minimal invasive">minimal invasive</a>, <a href="https://publications.waset.org/abstracts/search?q=esophagectomy" title=" esophagectomy"> esophagectomy</a>, <a href="https://publications.waset.org/abstracts/search?q=laparscopic" title=" laparscopic"> laparscopic</a>, <a href="https://publications.waset.org/abstracts/search?q=cancer" title=" cancer"> cancer</a> </p> <a href="https://publications.waset.org/abstracts/174999/minimal-invasive-esophagectomy-for-esophageal-cancer-an-institutional-review-from-a-dedicated-centre-of-pakistan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/174999.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">74</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">871</span> An Evaluation Model for Automatic Map Generalization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Quynhan%20Tran">Quynhan Tran</a>, <a href="https://publications.waset.org/abstracts/search?q=Hong%20Fan"> Hong Fan</a>, <a href="https://publications.waset.org/abstracts/search?q=Quockhanh%20Pham"> Quockhanh Pham</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Automatic map generalization is a well-known problem in cartography. The development of map generalization research accompanied the development of cartography. The traditional map is plotted manually by cartographic experts. The paper studies none-scale automation generalization of resident polygons and house marker symbol, proposes methodology to evaluate the result maps based on minimal spanning tree. In this paper, the minimal spanning tree before and after map generalization is compared to evaluate whether the generalization result maintain the geographical distribution of features. The minimal spanning tree in vector format is firstly converted into a raster format and the grid size is 2mm (distance on the map). The statistical number of matching grid before and after map generalization and the ratio of overlapping grid to the total grids is calculated. Evaluation experiments are conduct to verify the results. Experiments show that this methodology can give an objective evaluation for the feature distribution and give specialist an hand while they evaluate result maps of none-scale automation generalization with their eyes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automatic%20cartography%20generalization" title="automatic cartography generalization">automatic cartography generalization</a>, <a href="https://publications.waset.org/abstracts/search?q=evaluation%20model" title=" evaluation model"> evaluation model</a>, <a href="https://publications.waset.org/abstracts/search?q=geographic%20feature%20distribution" title=" geographic feature distribution"> geographic feature distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20spanning%20tree" title=" minimal spanning tree"> minimal spanning tree</a> </p> <a href="https://publications.waset.org/abstracts/23148/an-evaluation-model-for-automatic-map-generalization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23148.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">636</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">870</span> Minimal Incision Cochlear Implantation in Congenital Abnormality: A Case Report</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Munish%20Saroch">Munish Saroch</a>, <a href="https://publications.waset.org/abstracts/search?q=Amit%20Saini"> Amit Saini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Introduction: Many children with congenital malformation of inner ear have undergone cochlear implant (CI) surgery. The results for cochlear implant surgery in these children are very encouraging and provide a ray of hope for these patients. Objective: The main objective of this presentation is to prove that even in Mondini’s deformity Minimal incision cochlear implantation improves cosmesis, reduces post-operative infection and earliest switch on of device. Methods: We report a case of two-year-old child suffering from Mondini’s deformity who underwent CI with minimal incision cochlear implantation (MICI). MICI has been developed with the aims of reducing the impact of surgery on the patient without any preoperative shaving of hairs. Results: Patient after surgery with MICI showed better looking postauricular scar, low post-operative morbidity in comparison to conventional wider access approach and hence earliest switch on of device (1st post operative day). Conclusion: We are of opinion that MICI is safe and successful in Mondini’s deformity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CI" title="CI">CI</a>, <a href="https://publications.waset.org/abstracts/search?q=Cochlear%20Implant" title=" Cochlear Implant"> Cochlear Implant</a>, <a href="https://publications.waset.org/abstracts/search?q=MICI" title=" MICI"> MICI</a>, <a href="https://publications.waset.org/abstracts/search?q=Minimal%20Incision%20Cochlear%20Implantation" title=" Minimal Incision Cochlear Implantation"> Minimal Incision Cochlear Implantation</a>, <a href="https://publications.waset.org/abstracts/search?q=HL" title=" HL"> HL</a>, <a href="https://publications.waset.org/abstracts/search?q=Hearing%20Loss" title=" Hearing Loss"> Hearing Loss</a>, <a href="https://publications.waset.org/abstracts/search?q=HRCT" title=" HRCT"> HRCT</a>, <a href="https://publications.waset.org/abstracts/search?q=High%20Resolution%20Computer%20Tomography" title=" High Resolution Computer Tomography"> High Resolution Computer Tomography</a>, <a href="https://publications.waset.org/abstracts/search?q=MRI" title=" MRI"> MRI</a>, <a href="https://publications.waset.org/abstracts/search?q=Magnetic%20resonance%20imaging" title=" Magnetic resonance imaging"> Magnetic resonance imaging</a>, <a href="https://publications.waset.org/abstracts/search?q=SCI" title=" SCI"> SCI</a>, <a href="https://publications.waset.org/abstracts/search?q=Standard%20cochlear%20implantation" title=" Standard cochlear implantation"> Standard cochlear implantation</a> </p> <a href="https://publications.waset.org/abstracts/46030/minimal-incision-cochlear-implantation-in-congenital-abnormality-a-case-report" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46030.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">216</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">869</span> The Use of Degradation Measures to Design Reliability Test Plans</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Stephen%20V.%20Crowder">Stephen V. Crowder</a>, <a href="https://publications.waset.org/abstracts/search?q=Jonathan%20W.%20Lane"> Jonathan W. Lane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With short production development times, there is an increased need to demonstrate product reliability relatively quickly with minimal testing. In such cases there may be few if any observed failures. Thus it may be difficult to assess reliability using the traditional reliability test plans that measure only time (or cycles) to failure. For many components, degradation measures will contain important information about performance and reliability. These measures can be used to design a minimal test plan, in terms of number of units placed on test and duration of the test, necessary to demonstrate a reliability goal. In this work we present a case study involving an electronic component subject to degradation. The data, consisting of 42 degradation paths of cycles to failure, are first used to estimate a reliability function. Bootstrapping techniques are then used to perform power studies and develop a minimal reliability test plan for future production of this component. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=degradation%20measure" title="degradation measure">degradation measure</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20to%20failure%20distribution" title=" time to failure distribution"> time to failure distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=bootstrap" title=" bootstrap"> bootstrap</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20science" title=" computational science"> computational science</a> </p> <a href="https://publications.waset.org/abstracts/5420/the-use-of-degradation-measures-to-design-reliability-test-plans" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5420.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">531</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">868</span> Optimal Replacement Period for a One-Unit System with Double Repair Cost Limits</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Min-Tsai%20Lai">Min-Tsai Lai</a>, <a href="https://publications.waset.org/abstracts/search?q=Taqwa%20Hariguna"> Taqwa Hariguna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a periodical replacement model for a system, considering the concept of single and cumulative repair cost limits simultaneously. The failures are divided into two types. Minor failure can be corrected by minimal repair and serious failure makes the system breakdown completely. When a minor failure occurs, if the repair cost is less than a single repair cost limit L1 and the accumulated repair cost is less than a cumulative repair cost limit L2, then minimal repair is executed, otherwise, the system is preventively replaced. The system is also replaced at time T or at serious failure. The optimal period T minimizing the long-run expected cost per unit time is verified to be finite and unique under some specific conditions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=repair-cost%20limit" title="repair-cost limit">repair-cost limit</a>, <a href="https://publications.waset.org/abstracts/search?q=cumulative%20repair-cost%20limit" title=" cumulative repair-cost limit"> cumulative repair-cost limit</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20repair" title=" minimal repair"> minimal repair</a>, <a href="https://publications.waset.org/abstracts/search?q=periodical%20replacement%20policy" title=" periodical replacement policy"> periodical replacement policy</a> </p> <a href="https://publications.waset.org/abstracts/28802/optimal-replacement-period-for-a-one-unit-system-with-double-repair-cost-limits" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28802.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">365</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">867</span> Screening of Minimal Salt Media for Biosurfactant Production by Bacillus spp.</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Y.%20M.%20Al-Wahaibi">Y. M. Al-Wahaibi</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20N.%20Al-Bahry"> S. N. Al-Bahry</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20E.%20Elshafie"> A. E. Elshafie</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20S.%20Al-Bemani"> A. S. Al-Bemani</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20J.%20Joshi"> S. J. Joshi</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20K.%20Al-Bahri"> A. K. Al-Bahri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Crude oil is a major source of global energy. The major problem is its widespread use and demand resulted is in increasing environmental pollution. One associated pollution problem is ‘oil spills’. Oil spills can be remediated with the use of chemical dispersants, microbial biodegradation and microbial metabolites such as biosurfactants. Four different minimal salt media for biosurfactant production by Bacillus isolated from oil contaminated sites from Oman were screened. These minimal salt media were supplemented with either glucose or sucrose as a carbon source. Among the isolates, W16 and B30 produced the most active biosurfactants. Isolate W16 produced better biosurfactant than the rest, and reduced surface tension (ST) and interfacial tension (IFT) to 25.26mN/m and 2.29mN/m respectively within 48h which are characteristics for removal of oil in contaminated sites. Biosurfactant was produced in bulk and extracted using acid precipitation method. Thin Layer Chromatography (TLC) of acid precipitate biosurfactant revealed two concentrated bands. Further studies of W16 biosurfactant in bioremediation of oil spills are recommended. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=oil%20contamination" title="oil contamination">oil contamination</a>, <a href="https://publications.waset.org/abstracts/search?q=remediation" title=" remediation"> remediation</a>, <a href="https://publications.waset.org/abstracts/search?q=Bacillus%20spp" title=" Bacillus spp"> Bacillus spp</a>, <a href="https://publications.waset.org/abstracts/search?q=biosurfactant" title=" biosurfactant"> biosurfactant</a>, <a href="https://publications.waset.org/abstracts/search?q=surface%20tension" title=" surface tension"> surface tension</a>, <a href="https://publications.waset.org/abstracts/search?q=interfacial%20tension" title=" interfacial tension"> interfacial tension</a> </p> <a href="https://publications.waset.org/abstracts/3731/screening-of-minimal-salt-media-for-biosurfactant-production-by-bacillus-spp" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3731.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">277</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">866</span> Extremal Laplacian Energy of Threshold Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Ahmad%20Mojallal">Seyed Ahmad Mojallal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be a connected threshold graph of order n with m edges and trace T. In this talk we give a lower bound on Laplacian energy in terms of n, m, and T of G. From this we determine the threshold graphs with the first four minimal Laplacian energies. We also list the first 20 minimal Laplacian energies among threshold graphs. Let σ=σ(G) be the number of Laplacian eigenvalues greater than or equal to average degree of graph G. Using this concept, we obtain the threshold graphs with the largest and the second largest Laplacian energies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20eigenvalues" title="Laplacian eigenvalues">Laplacian eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20energy" title=" Laplacian energy"> Laplacian energy</a>, <a href="https://publications.waset.org/abstracts/search?q=threshold%20graphs" title=" threshold graphs"> threshold graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=extremal%20graphs" title=" extremal graphs"> extremal graphs</a> </p> <a href="https://publications.waset.org/abstracts/41332/extremal-laplacian-energy-of-threshold-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41332.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">388</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">865</span> Parameter Estimation for the Oral Minimal Model and Parameter Distinctions Between Obese and Non-obese Type 2 Diabetes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manoja%20Rajalakshmi%20Aravindakshana">Manoja Rajalakshmi Aravindakshana</a>, <a href="https://publications.waset.org/abstracts/search?q=Devleena%20Ghosha"> Devleena Ghosha</a>, <a href="https://publications.waset.org/abstracts/search?q=Chittaranjan%20Mandala"> Chittaranjan Mandala</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20V.%20Venkateshb"> K. V. Venkateshb</a>, <a href="https://publications.waset.org/abstracts/search?q=Jit%20Sarkarc"> Jit Sarkarc</a>, <a href="https://publications.waset.org/abstracts/search?q=Partha%20Chakrabartic"> Partha Chakrabartic</a>, <a href="https://publications.waset.org/abstracts/search?q=Sujay%20K.%20Maity"> Sujay K. Maity</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Oral Glucose Tolerance Test (OGTT) is the primary test used to diagnose type 2 diabetes mellitus (T2DM) in a clinical setting. Analysis of OGTT data using the Oral Minimal Model (OMM) along with the rate of appearance of ingested glucose (Ra) is performed to study differences in model parameters for control and T2DM groups. The differentiation of parameters of the model gives insight into the behaviour and physiology of T2DM. The model is also studied to find parameter differences among obese and non-obese T2DM subjects and the sensitive parameters were co-related to the known physiological findings. Sensitivity analysis is performed to understand changes in parameter values with model output and to support the findings, appropriate statistical tests are done. This seems to be the first preliminary application of the OMM with obesity as a distinguishing factor in understanding T2DM from estimated parameters of insulin-glucose model and relating the statistical differences in parameters to diabetes pathophysiology. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=oral%20minimal%20model" title="oral minimal model">oral minimal model</a>, <a href="https://publications.waset.org/abstracts/search?q=OGTT" title=" OGTT"> OGTT</a>, <a href="https://publications.waset.org/abstracts/search?q=obese%20and%20non-obese%20T2DM" title=" obese and non-obese T2DM"> obese and non-obese T2DM</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20modeling" title=" mathematical modeling"> mathematical modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=parameter%20estimation" title=" parameter estimation"> parameter estimation</a> </p> <a href="https://publications.waset.org/abstracts/158794/parameter-estimation-for-the-oral-minimal-model-and-parameter-distinctions-between-obese-and-non-obese-type-2-diabetes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/158794.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">92</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=minimal%20makespan&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20makespan&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20makespan&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20makespan&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20makespan&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20makespan&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20makespan&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20makespan&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20makespan&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=minimal%20makespan&page=29">29</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20makespan&page=30">30</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20makespan&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>