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: precedence constraint</title> <meta name="description" content="Search results for: precedence constraint"> <meta name="keywords" content="precedence constraint"> <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="precedence constraint" 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="precedence constraint"> <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> 438</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: precedence constraint</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">438</span> An Improved Genetic Algorithm for Traveling Salesman Problem with Precedence Constraint</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20F.%20F.%20Ab%20Rashid">M. F. F. Ab Rashid</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20N.%20Mohd%20Rose"> A. N. Mohd Rose</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20M.%20Z.%20Nik%20Mohamed"> N. M. Z. Nik Mohamed</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20S.%20Wan%20Harun"> W. S. Wan Harun</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20A.%20Che%20Ghani"> S. A. Che Ghani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traveling salesman problem with precedence constraint (TSPPC) is one of the most complex problems in combinatorial optimization. The existing algorithms to solve TSPPC cost large computational time to find the optimal solution. The purpose of this paper is to present an efficient genetic algorithm that guarantees optimal solution with less number of generations and iterations time. Unlike the existing algorithm that generates priority factor as chromosome, the proposed algorithm directly generates sequence of solution as chromosome. As a result, the proposed algorithm is capable of generating optimal solution with smaller number of generations and iteration time compare to existing algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title="traveling salesman problem">traveling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=sequencing" title=" sequencing"> sequencing</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=precedence%20constraint" title=" precedence constraint"> precedence constraint</a> </p> <a href="https://publications.waset.org/abstracts/15486/an-improved-genetic-algorithm-for-traveling-salesman-problem-with-precedence-constraint" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15486.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">560</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">437</span> Pragmatic Survey of Precedence as Linguistic 'Déjà Vu' in Political Text and Talk</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zarine%20Avetisyan">Zarine Avetisyan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Both in language and literature there exists the theory of recurrence of text and talk chunks which brings us to the notion of precedence. It must be stated that precedence as a pragma-linguistic phenomenon is yet underknown and it is the main objective of the present research to revisit and reveal it thoroughly. In line with the main research objective, analysis of political text and talk provides abundant relevant data for the illustration of the phenomenon of precedence. The analysis focuses on certain pragmatic universals (e.g. intention) and categories (e.g. speech techniques) which lead to the disclosure of the present object of study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=intention" title="intention">intention</a>, <a href="https://publications.waset.org/abstracts/search?q=precedence" title=" precedence"> precedence</a>, <a href="https://publications.waset.org/abstracts/search?q=political%20discourse" title=" political discourse"> political discourse</a>, <a href="https://publications.waset.org/abstracts/search?q=pragmatic%20universals" title=" pragmatic universals"> pragmatic universals</a> </p> <a href="https://publications.waset.org/abstracts/34221/pragmatic-survey-of-precedence-as-linguistic-deja-vu-in-political-text-and-talk" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34221.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">430</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">436</span> Validation and Interpretation about Precedence Diagram for Start to Finish Relationship by Graph Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Naoki%20Ohshima">Naoki Ohshima</a>, <a href="https://publications.waset.org/abstracts/search?q=Ken%20Kaminishi"> Ken Kaminishi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Four types of dependencies, which are 'Finish-to-start', 'Finish-to-finish', 'Start-to-start' and 'Start-to-finish (S-F)' as logical relationship are modeled based on the definition by 'the predecessor activity is defined as an activity to come before a dependent activity in a schedule' in PMBOK. However, it is found a self-contradiction in the precedence diagram for S-F relationship by PMBOK. In this paper, author would like to validate logical relationship of S-F by Graph Theory and propose a new interpretation of the precedence diagram for S-F relationship. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=project%20time%20management" title="project time management">project time management</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence%20activity" title=" sequence activity"> sequence activity</a>, <a href="https://publications.waset.org/abstracts/search?q=start-to-finish%20relationship" title=" start-to-finish relationship"> start-to-finish relationship</a>, <a href="https://publications.waset.org/abstracts/search?q=precedence%20diagram" title=" precedence diagram"> precedence diagram</a>, <a href="https://publications.waset.org/abstracts/search?q=PMBOK" title=" PMBOK"> PMBOK</a> </p> <a href="https://publications.waset.org/abstracts/74786/validation-and-interpretation-about-precedence-diagram-for-start-to-finish-relationship-by-graph-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74786.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">270</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">435</span> Studying the Spatial Aspects of Visual Attention Processing in Global Precedence Paradigm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shreya%20Borthakur">Shreya Borthakur</a>, <a href="https://publications.waset.org/abstracts/search?q=Aastha%20Vartak"> Aastha Vartak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This behavioral experiment aimed to investigate the global precedence phenomenon in a South Asian sample and its correlation with mobile screen time. The global precedence effect refers to the tendency to process overall structure before attending to specific details. Participants completed attention tasks involving global and local stimuli with varying consistencies. The results showed a tendency towards local precedence, but no significant differences in reaction times were found between consistency levels or attention conditions. However, the correlation analysis revealed that participants with higher screen time exhibited a stronger negative correlation with local attention, suggesting that excessive screen usage may impact perceptual organization. Further research is needed to explore this relationship and understand the influence of screen time on cognitive processing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=global%20precedence" title="global precedence">global precedence</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20attention" title=" visual attention"> visual attention</a>, <a href="https://publications.waset.org/abstracts/search?q=perceptual%20organization" title=" perceptual organization"> perceptual organization</a>, <a href="https://publications.waset.org/abstracts/search?q=screen%20time" title=" screen time"> screen time</a>, <a href="https://publications.waset.org/abstracts/search?q=cognition" title=" cognition"> cognition</a> </p> <a href="https://publications.waset.org/abstracts/169660/studying-the-spatial-aspects-of-visual-attention-processing-in-global-precedence-paradigm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/169660.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">68</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">434</span> A Survey on Constraint Solving Approaches Using Parallel Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nebras%20Gharbi">Nebras Gharbi</a>, <a href="https://publications.waset.org/abstracts/search?q=Itebeddine%20Ghorbel"> Itebeddine Ghorbel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the latest years and with the advancements of the multicore computing world, the constraint programming community tried to benefit from the capacity of new machines and make the best use of them through several parallel schemes for constraint solving. In this paper, we propose a survey of the different proposed approaches to solve Constraint Satisfaction Problems using parallel architectures. These approaches use in a different way a parallel architecture: the problem itself could be solved differently by several solvers or could be split over solvers. <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=parallel%20programming" title=" parallel programming"> parallel programming</a>, <a href="https://publications.waset.org/abstracts/search?q=constraint%20satisfaction%20problem" title=" constraint satisfaction problem"> constraint satisfaction problem</a>, <a href="https://publications.waset.org/abstracts/search?q=speed-up" title=" speed-up"> speed-up</a> </p> <a href="https://publications.waset.org/abstracts/50394/a-survey-on-constraint-solving-approaches-using-parallel-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50394.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">433</span> Critical Activity Effect on Project Duration in Precedence Diagram Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salman%20Ali%20Nisar">Salman Ali Nisar</a>, <a href="https://publications.waset.org/abstracts/search?q=Koshi%20Suzuki"> Koshi Suzuki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Precedence Diagram Method (PDM) with its additional relationships i.e., start-to-start, finish-to-finish, and start-to-finish, between activities provides more flexible schedule than traditional Critical Path Method (CPM). But, changing the duration of critical activities in PDM network will have anomalous effect on critical path. Researchers have proposed some classification of critical activity effects. In this paper, we do further study on classifications of critical activity effect and provide more information in detailed. Furthermore, we determine the maximum amount of time for each class of critical activity effect by which the project managers can control the dynamic feature (shortening/lengthening) of critical activities and project duration more efficiently. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=construction%20project%20management" title="construction project management">construction project management</a>, <a href="https://publications.waset.org/abstracts/search?q=critical%20path%20method" title=" critical path method"> critical path method</a>, <a href="https://publications.waset.org/abstracts/search?q=project%20scheduling" title=" project scheduling"> project scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=precedence%20diagram%20method" title=" precedence diagram method"> precedence diagram method</a> </p> <a href="https://publications.waset.org/abstracts/11841/critical-activity-effect-on-project-duration-in-precedence-diagram-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11841.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">511</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">432</span> The Effect of Critical Activity on Critical Path and Project Duration in Precedence Diagram Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Nisar">J. Nisar</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Halim"> S. Halim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The additional relationships i.e., start-to-start, finish-to-finish, and start-to-finish, between activity in Precedence Diagram Method (PDM) provides a more flexible schedule than traditional Critical Path Method (CPM). But, changing the duration of critical activities in the PDM network will have an anomalous effect on the critical path and the project completion date. In this study, we classified the critical activities in two groups i.e., 1. activity on single critical path and 2. activity on multi-critical paths, and six classes i.e., normal, reverse, neutral, perverse, decrease-reverse and increase-normal, based on their effects on project duration in PDM. Furthermore, we determined the maximum float of time by which the duration each type of critical activities can be changed without effecting the project duration. This study would help the project manager to clearly understand the behavior of each critical activity on critical path, and he/she would be able to change the project duration by shortening or lengthening activities based on project budget and project deadline. <p class="card-text"><strong>Keywords:</strong> <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=critical%20path%20method" title=" critical path method"> critical path method</a>, <a href="https://publications.waset.org/abstracts/search?q=project%20scheduling%20network" title=" project scheduling network"> project scheduling network</a>, <a href="https://publications.waset.org/abstracts/search?q=precedence%20diagram%20method" title=" precedence diagram method"> precedence diagram method</a> </p> <a href="https://publications.waset.org/abstracts/97001/the-effect-of-critical-activity-on-critical-path-and-project-duration-in-precedence-diagram-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97001.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">222</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">431</span> Resource Constrained Time-Cost Trade-Off Analysis in Construction Project Planning and Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sangwon%20Han">Sangwon Han</a>, <a href="https://publications.waset.org/abstracts/search?q=Chengquan%20Jin"> Chengquan Jin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Time-cost trade-off (TCTO) is one of the most significant part of construction project management. Despite the significance, current TCTO analysis, based on the Critical Path Method, does not consider resource constraint, and accordingly sometimes generates an impractical and/or infeasible schedule planning in terms of resource availability. Therefore, resource constraint needs to be considered when doing TCTO analysis. In this research, genetic algorithms (GA) based optimization model is created in order to find the optimal schedule. This model is utilized to compare four distinct scenarios (i.e., 1) initial CPM, 2) TCTO without considering resource constraint, 3) resource allocation after TCTO, and 4) TCTO with considering resource constraint) in terms of duration, cost, and resource utilization. The comparison results identify that ‘TCTO with considering resource constraint’ generates the optimal schedule with the respect of duration, cost, and resource. This verifies the need for consideration of resource constraint when doing TCTO analysis. It is expected that the proposed model will produce more feasible and optimal schedule. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=time-cost%20trade-off" title="time-cost trade-off">time-cost trade-off</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=critical%20path" title=" critical path"> critical path</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20availability" title=" resource availability"> resource availability</a> </p> <a href="https://publications.waset.org/abstracts/91630/resource-constrained-time-cost-trade-off-analysis-in-construction-project-planning-and-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/91630.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">187</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">430</span> Bi-Directional Evolutionary Topology Optimization Based on Critical Fatigue Constraint </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khodamorad%20Nabaki">Khodamorad Nabaki</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianhu%20Shen"> Jianhu Shen</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaodong%20Huang"> Xiaodong Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper develops a method for considering the critical fatigue stress as a constraint in the Bi-directional Evolutionary Structural Optimization (BESO) method. Our aim is to reach an optimal design in which high cycle fatigue failure does not occur for a specific life time. The critical fatigue stress is calculated based on modified Goodman criteria and used as a stress constraint in our topology optimization problem. Since fatigue generally does not occur for compressive stresses, we use the p-norm approach of the stress measurement that considers the highest tensile principal stress in each point as stress measure to calculate the sensitivity numbers. The BESO method has been extended to minimize volume an object subjected to the critical fatigue stress constraint. The optimization results are compared with the results from the compliance minimization problem which shows clearly the merits of our newly developed approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=topology%20optimization" title="topology optimization">topology optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=BESO%20method" title=" BESO method"> BESO method</a>, <a href="https://publications.waset.org/abstracts/search?q=p-norm" title=" p-norm"> p-norm</a>, <a href="https://publications.waset.org/abstracts/search?q=fatigue%20constraint" title=" fatigue constraint"> fatigue constraint</a> </p> <a href="https://publications.waset.org/abstracts/78086/bi-directional-evolutionary-topology-optimization-based-on-critical-fatigue-constraint" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78086.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">295</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">429</span> The Rupture Potential of Nerve Tissue Constrained Intracranial Saccular Aneurysm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Alam">M. Alam</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Seshaiyer"> P. Seshaiyer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The rupture predictability of intracranial aneurysm is one of the most important parameters for physicians in surgical treatment. As most of the intracranial aneurysms are asymptomatic, still the rupture potential of both symptomatic and asymptomatic lesions is relatively unknown. Moreover, an intracranial aneurysm constrained by a nerve tissue might be a common scenario for a physician to deal with during the treatment process. Here, we perform a computational modeling of nerve tissue constrained intracranial saccular aneurysm to show a protective role of constrained tissue on the aneurysm. A comparative parametric study of the model also performs taking long constraint, medium constraint, short constraint, point contact, narrow neck aneurysm, wide neck aneurysm as parameters for the analysis. Results show that contact constraint aneurysm generates less stress near the fundus compared to no constraint aneurysm, hence works as a protective wall for the aneurysm not to be ruptured. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rupture%20potential" title="rupture potential">rupture potential</a>, <a href="https://publications.waset.org/abstracts/search?q=intracranial%20saccular%20aneurysm" title=" intracranial saccular aneurysm"> intracranial saccular aneurysm</a>, <a href="https://publications.waset.org/abstracts/search?q=anisotropic%20hyper-elastic%20material" title=" anisotropic hyper-elastic material"> anisotropic hyper-elastic material</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20analysis" title=" finite element analysis"> finite element analysis</a> </p> <a href="https://publications.waset.org/abstracts/82839/the-rupture-potential-of-nerve-tissue-constrained-intracranial-saccular-aneurysm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82839.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">428</span> A Genetic Algorithm Approach for Multi Constraint Team Orienteering Problem with Time Windows </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Uyanga%20Sukhbaatar">Uyanga Sukhbaatar</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Lbath"> Ahmed Lbath</a>, <a href="https://publications.waset.org/abstracts/search?q=Mendamar%20Majig"> Mendamar Majig</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Orienteering Problem is the most known example to start modeling tourist trip design problem. In order to meet tourist’s interest and constraint the OP is becoming more and more complicate to solve. The Multi Constraint Team Orienteering Problem with Time Windows is the last extension of the OP which differentiates from other extensions by including more extra associated constraints. The goal of the MCTOPTW is maximizing tourist’s satisfaction score in same time not to violate any of these constraints. This paper presents a genetic algorithmic approach to tackle the MCTOPTW. The benchmark data from literature is tested by our algorithm and the performance results are compared. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi%20constraint%20team%20orienteering%20problem%20with%20time%20windows" title="multi constraint team orienteering problem with time windows">multi constraint team orienteering problem with time windows</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=tour%20planning%20system" title=" tour planning system"> tour planning system</a> </p> <a href="https://publications.waset.org/abstracts/29951/a-genetic-algorithm-approach-for-multi-constraint-team-orienteering-problem-with-time-windows" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29951.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">627</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">427</span> Exhaustive Study of Essential Constraint Satisfaction Problem Techniques Based on N-Queens Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Md.%20Ahsan%20Ayub">Md. Ahsan Ayub</a>, <a href="https://publications.waset.org/abstracts/search?q=Kazi%20A.%20Kalpoma"> Kazi A. Kalpoma</a>, <a href="https://publications.waset.org/abstracts/search?q=Humaira%20Tasnim%20Proma"> Humaira Tasnim Proma</a>, <a href="https://publications.waset.org/abstracts/search?q=Syed%20Mehrab%20Kabir"> Syed Mehrab Kabir</a>, <a href="https://publications.waset.org/abstracts/search?q=Rakib%20Ibna%20Hamid%20Chowdhury"> Rakib Ibna Hamid Chowdhury</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Constraint Satisfaction Problem (CSP) is observed in various applications, i.e., scheduling problems, timetabling problems, assignment problems, etc. Researchers adopt a CSP technique to tackle a certain problem; however, each technique follows different approaches and ways to solve a problem network. In our exhaustive study, it has been possible to visualize the processes of essential CSP algorithms from a very concrete constraint satisfaction example, NQueens Problem, in order to possess a deep understanding about how a particular constraint satisfaction problem will be dealt with by our studied and implemented techniques. Besides, benchmark results - time vs. value of N in N-Queens - have been generated from our implemented approaches, which help understand at what factor each algorithm produces solutions; especially, in N-Queens puzzle. Thus, extended decisions can be made to instantiate a real life problem within CSP’s framework. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=arc%20consistency%20%28AC%29" title="arc consistency (AC)">arc consistency (AC)</a>, <a href="https://publications.waset.org/abstracts/search?q=backjumping%20algorithm%20%28BJ%29" title=" backjumping algorithm (BJ)"> backjumping algorithm (BJ)</a>, <a href="https://publications.waset.org/abstracts/search?q=backtracking%20algorithm%20%28BT%29" title=" backtracking algorithm (BT)"> backtracking algorithm (BT)</a>, <a href="https://publications.waset.org/abstracts/search?q=constraint%20satisfaction%20problem%20%28CSP%29" title=" constraint satisfaction problem (CSP)"> constraint satisfaction problem (CSP)</a>, <a href="https://publications.waset.org/abstracts/search?q=forward%20checking%20%28FC%29" title=" forward checking (FC)"> forward checking (FC)</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20constrained%20values%20%28LCV%29" title=" least constrained values (LCV)"> least constrained values (LCV)</a>, <a href="https://publications.waset.org/abstracts/search?q=maintaining%20arc%20consistency%20%28MAC%29" title=" maintaining arc consistency (MAC)"> maintaining arc consistency (MAC)</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20remaining%20values%20%28MRV%29" title=" minimum remaining values (MRV)"> minimum remaining values (MRV)</a>, <a href="https://publications.waset.org/abstracts/search?q=N-Queens%20problem" title=" N-Queens problem"> N-Queens problem</a> </p> <a href="https://publications.waset.org/abstracts/69933/exhaustive-study-of-essential-constraint-satisfaction-problem-techniques-based-on-n-queens-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69933.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">364</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">426</span> Hydraulic Resources Management under Imperfect Competition with Thermal Plants in the Wholesale Electricity Market</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdessalem%20Abbassi">Abdessalem Abbassi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahlem%20Dakhlaoui"> Ahlem Dakhlaoui</a>, <a href="https://publications.waset.org/abstracts/search?q=Lota%20D.%20Tamini"> Lota D. Tamini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we analyze infinite discrete-time games between hydraulic and thermal power operators in the wholesale electricity market under Cournot competition. We consider a deregulated electrical industry where certain demand is satisfied by hydraulic and thermal technologies. The hydraulic operator decides the production in each season of each period that maximizes the sum of expected profits from power generation with respect to the stochastic dynamic constraint on the water stored in the dam, the environmental constraint and the non-negative output constraint. In contrast, the thermal plant is operated with quadratic cost function, with respect to the capacity production constraint and the non-negativity output constraint. We show that under imperfect competition, the hydraulic operator has a strategic storage of water in the peak season. Then, we quantify the strategic inter-annual and intra-annual water transfer and compare the numerical results. Finally, we show that the thermal operator can restrict the hydraulic output without compensation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asymmetric%20risk%20aversion" title="asymmetric risk aversion">asymmetric risk aversion</a>, <a href="https://publications.waset.org/abstracts/search?q=electricity%20wholesale%20market" title=" electricity wholesale market"> electricity wholesale market</a>, <a href="https://publications.waset.org/abstracts/search?q=hydropower%20dams" title=" hydropower dams"> hydropower dams</a>, <a href="https://publications.waset.org/abstracts/search?q=imperfect%20competition" title=" imperfect competition"> imperfect competition</a> </p> <a href="https://publications.waset.org/abstracts/38733/hydraulic-resources-management-under-imperfect-competition-with-thermal-plants-in-the-wholesale-electricity-market" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38733.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">425</span> Share Pledging and Financial Constraints in China</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zijian%20Cheng">Zijian Cheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Frank%20Liu"> Frank Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yupu%20Sun"> Yupu Sun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The relationship between the intensity of share pledging activities and the level of financial constraint in publicly listed firms in China is examined in this paper. Empirical results show that the high financial constraint level may motivate insiders to use share pledging as an alternative funding source and an expropriation mechanism. Share collateralization can cause a subsequently more constrained financing condition. Evidence is found that share pledging made by the controlling shareholder is likely to mitigate financial constraints in the following year. Research findings are robust to alternative measures and an instrumental variable for dealing with endogeneity problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=share%20pledge" title="share pledge">share pledge</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20constraint" title=" financial constraint"> financial constraint</a>, <a href="https://publications.waset.org/abstracts/search?q=controlling%20shareholder" title=" controlling shareholder"> controlling shareholder</a>, <a href="https://publications.waset.org/abstracts/search?q=dividend%20policy" title=" dividend policy"> dividend policy</a> </p> <a href="https://publications.waset.org/abstracts/128185/share-pledging-and-financial-constraints-in-china" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128185.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">165</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">424</span> Three-Stage Multivariate Stratified Sample Surveys with Probabilistic Cost Constraint and Random Variance </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sanam%20Haseen">Sanam Haseen</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Bari"> Abdul Bari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper a three stage multivariate programming problem with random survey cost and variances as random variables has been formulated as a non-linear stochastic programming problem. The problem has been converted into an equivalent deterministic form using chance constraint programming and modified E-modeling. An empirical study of the problem has been done at the end of the paper using R-simulation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chance%20constraint%20programming" title="chance constraint programming">chance constraint programming</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20E-model" title=" modified E-model"> modified E-model</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20programming" title=" stochastic programming"> stochastic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=stratified%20sample%20surveys" title=" stratified sample surveys"> stratified sample surveys</a>, <a href="https://publications.waset.org/abstracts/search?q=three%20stage%20sample%20surveys" title=" three stage sample surveys"> three stage sample surveys</a> </p> <a href="https://publications.waset.org/abstracts/14515/three-stage-multivariate-stratified-sample-surveys-with-probabilistic-cost-constraint-and-random-variance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14515.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">458</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">423</span> Quality-Of-Service-Aware Green Bandwidth Allocation in Ethernet Passive Optical Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tzu-Yang%20Lin">Tzu-Yang Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Chuan-Ching%20Sue"> Chuan-Ching Sue </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sleep mechanisms are commonly used to ensure the energy efficiency of each optical network unit (ONU) that concerns a single class delay constraint in the Ethernet Passive Optical Network (EPON). How long the ONUs can sleep without violating the delay constraint has become a research problem. Particularly, we can derive an analytical model to determine the optimal sleep time of ONUs in every cycle without violating the maximum class delay constraint. The bandwidth allocation considering such optimal sleep time is called Green Bandwidth Allocation (GBA). Although the GBA mechanism guarantees that the different class delay constraints do not violate the maximum class delay constraint, packets with a more relaxed delay constraint will be treated as those with the most stringent delay constraint and may be sent early. This means that the ONU will waste energy in active mode to send packets in advance which did not need to be sent at the current time. Accordingly, we proposed a QoS-aware GBA using a novel intra-ONU scheduling to control the packets to be sent according to their respective delay constraints, thereby enhancing energy efficiency without deteriorating delay performance. If packets are not explicitly classified but with different packet delay constraints, we can modify the intra-ONU scheduling to classify packets according to their packet delay constraints rather than their classes. Moreover, we propose the switchable ONU architecture in which the ONU can switch the architecture according to the sleep time length, thus improving energy efficiency in the QoS-aware GBA. The simulation results show that the QoS-aware GBA ensures that packets in different classes or with different delay constraints do not violate their respective delay constraints and consume less power than the original GBA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Passive%20Optical%20Networks" title="Passive Optical Networks">Passive Optical Networks</a>, <a href="https://publications.waset.org/abstracts/search?q=PONs" title=" PONs"> PONs</a>, <a href="https://publications.waset.org/abstracts/search?q=Optical%20Network%20Unit" title=" Optical Network Unit"> Optical Network Unit</a>, <a href="https://publications.waset.org/abstracts/search?q=ONU" title=" ONU"> ONU</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20efficiency" title=" energy efficiency"> energy efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=delay%20constraint" title=" delay constraint"> delay constraint</a> </p> <a href="https://publications.waset.org/abstracts/94624/quality-of-service-aware-green-bandwidth-allocation-in-ethernet-passive-optical-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94624.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">284</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">422</span> Constraint-Directed Techniques for Transport Scheduling with Capacity Restrictions of Automotive Manufacturing Components</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Martha%20Ndeley">Martha Ndeley</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Ikome"> John Ikome</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we expand the scope of constraint-directed techniques to deal with the case of transportation schedule with capacity restrictions where the scheduling problem includes alternative activities. That is, not only does the scheduling problem consist of determining when an activity is to be executed, but also determining which set of alternative activities is to be executed at all level of transportation from input to output. Such problems encompass both alternative resource problems and alternative process plan problems. We formulate a constraint-based representation of alternative activities to model problems containing such choices. We then extend existing constraint-directed scheduling heuristic commitment techniques and propagators to reason directly about the fact that an activity does not necessarily have to exist in a final transportation schedule without being completed. Tentative results show that an algorithm using a novel texture-based heuristic commitment technique propagators achieves the best overall performance of the techniques tested. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=production" title="production">production</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation" title=" transportation"> transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=integrated" title=" integrated"> integrated</a> </p> <a href="https://publications.waset.org/abstracts/50638/constraint-directed-techniques-for-transport-scheduling-with-capacity-restrictions-of-automotive-manufacturing-components" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50638.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">362</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">421</span> An Investigation of Commitment to Marital Relationship Precedents through Self-Expansion in Students from the Medical Science University of Iran</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mehravar%20Javid">Mehravar Javid</a>, <a href="https://publications.waset.org/abstracts/search?q=Laura%20Reid%20Harris"> Laura Reid Harris</a>, <a href="https://publications.waset.org/abstracts/search?q=Zahra%20Khodadadi"> Zahra Khodadadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Rachel%20Walton"> Rachel Walton</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study aimed to explore commitment precedence through self-expansion among students at the Medical Science University of Shiraz, Iran. Method: The statistical population was comprised of students at Shiraz University of Medical Science during the academic years 2013 to 2014. Using random sampling, 133 married students (50 males and 83 females) were selected. The commitment condition of this studied group was assessed using Adam and Jones' (1999) Marital Commitment Dimensions Scale (DCI), and self-expansion was measured using Aron and Lewandowski's (2002) Self-Expansion Questionnaire. Simple regression analyses investigated commitment precedence via self-expansion. Results: The data revealed a positive correlation between total commitment (r=0.35, p < 0.01), the subscales of commitment to the spouse (r=0.43, p < 0.01), and commitment to marriage (r=0.31, p < 0.01). Regression analyses indicated that perceived self-expansion positively correlated with commitment to marital relationships in married students. The findings suggest that an increased possibility of self-expansion in a marital relationship corresponds with heightened commitment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=commitment%20to%20marital%20relationship" title="commitment to marital relationship">commitment to marital relationship</a>, <a href="https://publications.waset.org/abstracts/search?q=married%20students" title=" married students"> married students</a>, <a href="https://publications.waset.org/abstracts/search?q=relationship%20dynamics" title=" relationship dynamics"> relationship dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=self-expansion" title=" self-expansion"> self-expansion</a> </p> <a href="https://publications.waset.org/abstracts/177957/an-investigation-of-commitment-to-marital-relationship-precedents-through-self-expansion-in-students-from-the-medical-science-university-of-iran" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/177957.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">67</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">420</span> Size Reduction of Images Using Constraint Optimization Approach for Machine Communications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chee%20Sun%20Won">Chee Sun Won</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the size reduction of images for machine-to-machine communications. Here, the salient image regions to be preserved include the image patches of the key-points such as corners and blobs. Based on a saliency image map from the key-points and their image patches, an axis-aligned grid-size optimization is proposed for the reduction of image size. To increase the size-reduction efficiency the aspect ratio constraint is relaxed in the constraint optimization framework. The proposed method yields higher matching accuracy after the size reduction than the conventional content-aware image size-reduction methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20compression" title="image compression">image compression</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20matching" title=" image matching"> image matching</a>, <a href="https://publications.waset.org/abstracts/search?q=key-point%20detection%20and%20description" title=" key-point detection and description"> key-point detection and description</a>, <a href="https://publications.waset.org/abstracts/search?q=machine-to-machine%20communication" title=" machine-to-machine communication"> machine-to-machine communication</a> </p> <a href="https://publications.waset.org/abstracts/67605/size-reduction-of-images-using-constraint-optimization-approach-for-machine-communications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67605.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">419</span> Extended Constraint Mask Based One-Bit Transform for Low-Complexity Fast Motion Estimation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=O%C4%9Fuzhan%20Urhan">Oğuzhan Urhan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, an improved motion estimation (ME) approach based on weighted constrained one-bit transform is proposed for block-based ME employed in video encoders. Binary ME approaches utilize low bit-depth representation of the original image frames with a Boolean exclusive-OR based hardware efficient matching criterion to decrease computational burden of the ME stage. Weighted constrained one-bit transform (WC‑1BT) based approach improves the performance of conventional C-1BT based ME employing 2-bit depth constraint mask instead of a 1-bit depth mask. In this work, the range of constraint mask is further extended to increase ME performance of WC-1BT approach. Experiments reveal that the proposed method provides better ME accuracy compared existing similar ME methods in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fast%20motion%20estimation%3B%20low-complexity%20motion%20estimation" title="fast motion estimation; low-complexity motion estimation">fast motion estimation; low-complexity motion estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=video%20coding" title=" video coding"> video coding</a> </p> <a href="https://publications.waset.org/abstracts/76760/extended-constraint-mask-based-one-bit-transform-for-low-complexity-fast-motion-estimation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76760.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">316</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">418</span> A Survey on Compression Methods for Table Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Gharbi">N. Gharbi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Constraint Satisfaction problems are mathematical problems that are often used to model many real-world problems for which we look if there exists a solution satisfying all its constraints. Table constraints are important for modeling parts of many problems since they list all combinations of allowed or forbidden values. However, they admit practical limitations because they are sometimes too large to be represented in a direct way. In this paper, we present a survey of the different categories of the proposed approaches to compress table constraints in order to reduce both space and time complexities. <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=compression" title=" compression"> compression</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=table%20constraints" title=" table constraints"> table constraints</a> </p> <a href="https://publications.waset.org/abstracts/49933/a-survey-on-compression-methods-for-table-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49933.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">326</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">417</span> Robust Batch Process Scheduling in Pharmaceutical Industries: A Case Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tommaso%20Adamo">Tommaso Adamo</a>, <a href="https://publications.waset.org/abstracts/search?q=Gianpaolo%20Ghiani"> Gianpaolo Ghiani</a>, <a href="https://publications.waset.org/abstracts/search?q=Antonio%20Domenico%20Grieco"> Antonio Domenico Grieco</a>, <a href="https://publications.waset.org/abstracts/search?q=Emanuela%20Guerriero"> Emanuela Guerriero</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Batch production plants provide a wide range of scheduling problems. In pharmaceutical industries a batch process is usually described by a recipe, consisting of an ordering of tasks to produce the desired product. In this research work we focused on pharmaceutical production processes requiring the culture of a microorganism population (i.e. bacteria, yeasts or antibiotics). Several sources of uncertainty may influence the yield of the culture processes, including (i) low performance and quality of the cultured microorganism population or (ii) microbial contamination. For these reasons, robustness is a valuable property for the considered application context. In particular, a robust schedule will not collapse immediately when a cell of microorganisms has to be thrown away due to a microbial contamination. Indeed, a robust schedule should change locally in small proportions and the overall performance measure (i.e. makespan, lateness) should change a little if at all. In this research work we formulated a constraint programming optimization (COP) model for the robust planning of antibiotics production. We developed a discrete-time model with a multi-criteria objective, ordering the different criteria and performing a lexicographic optimization. A feasible solution of the proposed COP model is a schedule of a given set of tasks onto available resources. The schedule has to satisfy tasks precedence constraints, resource capacity constraints and time constraints. In particular time constraints model tasks duedates and resource availability time windows constraints. To improve the schedule robustness, we modeled the concept of (a, b) super-solutions, where (a, b) are input parameters of the COP model. An (a, b) super-solution is one in which if a variables (i.e. the completion times of a culture tasks) lose their values (i.e. cultures are contaminated), the solution can be repaired by assigning these variables values with a new values (i.e. the completion times of a backup culture tasks) and at most b other variables (i.e. delaying the completion of at most b other tasks). The efficiency and applicability of the proposed model is demonstrated by solving instances taken from Sanofi Aventis, a French pharmaceutical company. Computational results showed that the determined super-solutions are near-optimal. <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=super-solutions" title=" super-solutions"> super-solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20scheduling" title=" robust scheduling"> robust scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=batch%20process" title=" batch process"> batch process</a>, <a href="https://publications.waset.org/abstracts/search?q=pharmaceutical%20industries" title=" pharmaceutical industries"> pharmaceutical industries</a> </p> <a href="https://publications.waset.org/abstracts/29803/robust-batch-process-scheduling-in-pharmaceutical-industries-a-case-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29803.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">618</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">416</span> Reconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Divyesh%20Patel">Divyesh Patel</a>, <a href="https://publications.waset.org/abstracts/search?q=Tanuja%20Srivastava"> Tanuja Srivastava</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20tomography" title="discrete tomography">discrete tomography</a>, <a href="https://publications.waset.org/abstracts/search?q=exactly-1-4-adjacency" title=" exactly-1-4-adjacency"> exactly-1-4-adjacency</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20matrices" title=" binary matrices"> binary matrices</a> </p> <a href="https://publications.waset.org/abstracts/8505/reconstruction-of-binary-matrices-satisfying-neighborhood-constraints-by-simulated-annealing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8505.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">406</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">415</span> Optimal Cropping Pattern in an Irrigation Project: A Hybrid Model of Artificial Neural Network and Modified Simplex Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safayat%20Ali%20Shaikh">Safayat Ali Shaikh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Software has been developed for optimal cropping pattern in an irrigation project considering land constraint, water availability constraint and pick up flow constraint using modified Simplex Algorithm. Artificial Neural Network Models (ANN) have been developed to predict rainfall. AR (1) model used to generate 1000 years rainfall data to train the ANN. Simulation has been done with expected rainfall data. Eight number crops and three types of soil class have been considered for optimization model. Area under each crop and each soil class have been quantified using Modified Simplex Algorithm to get optimum net return. Efficacy of the software has been tested using data of large irrigation project in India. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20neural%20network" title="artificial neural network">artificial neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20irrigation%20project" title=" large irrigation project"> large irrigation project</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm" title=" modified simplex algorithm"> modified simplex algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20cropping%20pattern" title=" optimal cropping pattern"> optimal cropping pattern</a> </p> <a href="https://publications.waset.org/abstracts/71956/optimal-cropping-pattern-in-an-irrigation-project-a-hybrid-model-of-artificial-neural-network-and-modified-simplex-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71956.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">203</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">414</span> Rating and Generating Sudoku Puzzles Based on Constraint Satisfaction Problems </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bahare%20Fatemi">Bahare Fatemi</a>, <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Mehran%20Kazemi"> Seyed Mehran Kazemi</a>, <a href="https://publications.waset.org/abstracts/search?q=Nazanin%20Mehrasa"> Nazanin Mehrasa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sudoku is a logic-based combinatorial puzzle game which people in different ages enjoy playing it. The challenging and addictive nature of this game has made it a ubiquitous game. Most magazines, newspapers, puzzle books, etc. publish lots of Sudoku puzzles every day. These puzzles often come in different levels of difficulty so that all people, from beginner to expert, can play the game and enjoy it. Generating puzzles with different levels of difficulty is a major concern of Sudoku designers. There are several works in the literature which propose ways of generating puzzles having a desirable level of difficulty. In this paper, we propose a method based on constraint satisfaction problems to evaluate the difficulty of the Sudoku puzzles. Then, we propose a hill climbing method to generate puzzles with different levels of difficulty. Whereas other methods are usually capable of generating puzzles with only few number of difficulty levels, our method can be used to generate puzzles with arbitrary number of different difficulty levels. We test our method by generating puzzles with different levels of difficulty and having a group of 15 people solve all the puzzles and recording the time they spend for each puzzle. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constraint%20satisfaction%20problem" title="constraint satisfaction problem">constraint satisfaction problem</a>, <a href="https://publications.waset.org/abstracts/search?q=generating%20Sudoku%20puzzles" title=" generating Sudoku puzzles"> generating Sudoku puzzles</a>, <a href="https://publications.waset.org/abstracts/search?q=hill%20climbing" title=" hill climbing"> hill climbing</a> </p> <a href="https://publications.waset.org/abstracts/8625/rating-and-generating-sudoku-puzzles-based-on-constraint-satisfaction-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8625.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">402</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">413</span> Verification of a Simple Model for Rolling Isolation System Response</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aarthi%20Sridhar">Aarthi Sridhar</a>, <a href="https://publications.waset.org/abstracts/search?q=Henri%20Gavin"> Henri Gavin</a>, <a href="https://publications.waset.org/abstracts/search?q=Karah%20Kelly"> Karah Kelly</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Rolling Isolation Systems (RISs) are simple and effective means to mitigate earthquake hazards to equipment in critical and precious facilities, such as hospitals, network collocation facilities, supercomputer centers, and museums. The RIS works by isolating components acceleration the inertial forces felt by the subsystem. The RIS consists of two platforms with counter-facing concave surfaces (dishes) in each corner. Steel balls lie inside the dishes and allow the relative motion between the top and bottom platform. Formerly, a mathematical model for the dynamics of RISs was developed using Lagrange’s equations (LE) and experimentally validated. A new mathematical model was developed using Gauss’s Principle of Least Constraint (GPLC) and verified by comparing impulse response trajectories of the GPLC model and the LE model in terms of the peak displacements and accelerations of the top platform. Mathematical models for the RIS are tedious to derive because of the non-holonomic rolling constraints imposed on the system. However, using Gauss’s Principle of Least constraint to find the equations of motion removes some of the obscurity and yields a system that can be easily extended. Though the GPLC model requires more state variables, the equations of motion are far simpler. The non-holonomic constraint is enforced in terms of accelerations and therefore requires additional constraint stabilization methods in order to avoid the possibility that numerical integration methods can cause the system to go unstable. The GPLC model allows the incorporation of more physical aspects related to the RIS, such as contribution of the vertical velocity of the platform to the kinetic energy and the mass of the balls. This mathematical model for the RIS is a tool to predict the motion of the isolation platform. The ability to statistically quantify the expected responses of the RIS is critical in the implementation of earthquake hazard mitigation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=earthquake%20hazard%20mitigation" title="earthquake hazard mitigation">earthquake hazard mitigation</a>, <a href="https://publications.waset.org/abstracts/search?q=earthquake%20isolation" title=" earthquake isolation"> earthquake isolation</a>, <a href="https://publications.waset.org/abstracts/search?q=Gauss%E2%80%99s%20Principle%20of%20Least%20Constraint" title=" Gauss’s Principle of Least Constraint"> Gauss’s Principle of Least Constraint</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20dynamics" title=" nonlinear dynamics"> nonlinear dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=rolling%20isolation%20system" title=" rolling isolation system"> rolling isolation system</a> </p> <a href="https://publications.waset.org/abstracts/81063/verification-of-a-simple-model-for-rolling-isolation-system-response" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81063.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">251</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">412</span> A Hybrid Model of Goal, Integer and Constraint Programming for Single Machine Scheduling Problem with Sequence Dependent Setup Times: A Case Study in Aerospace Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Didem%20Can">Didem Can</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scheduling problems are one of the most fundamental issues of production systems. Many different approaches and models have been developed according to the production processes of the parts and the main purpose of the problem. In this study, one of the bottleneck stations of a company serving in the aerospace industry is analyzed and considered as a single machine scheduling problem with sequence-dependent setup times. The objective of the problem is assigning a large number of similar parts to the same shift -to reduce chemical waste- while minimizing the number of tardy jobs. The goal programming method will be used to achieve two different objectives simultaneously. The assignment of parts to the shift will be expressed using the integer programming method. Finally, the constraint programming method will be used as it provides a way to find a result in a short time by avoiding worse resulting feasible solutions with the defined variables set. The model to be established will be tested and evaluated with real data in the application part. <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=goal%20programming" title=" goal programming"> goal programming</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title=" integer programming"> integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence-dependent%20setup" title="sequence-dependent setup">sequence-dependent setup</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20machine%20scheduling" title=" single machine scheduling"> single machine scheduling</a> </p> <a href="https://publications.waset.org/abstracts/144504/a-hybrid-model-of-goal-integer-and-constraint-programming-for-single-machine-scheduling-problem-with-sequence-dependent-setup-times-a-case-study-in-aerospace-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144504.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">237</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">411</span> Design of Visual Repository, Constraint and Process Modeling Tool Based on Eclipse Plug-Ins</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rushiraj%20Heshi">Rushiraj Heshi</a>, <a href="https://publications.waset.org/abstracts/search?q=Smriti%20Bhandari"> Smriti Bhandari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Master Data Management requires creation of Central repository, applying constraints on Repository and designing processes to manage data. Designing of Repository, constraints on repository and business processes is very tedious and time consuming task for large Enterprise. Hence Visual Repository, constraints and Process (Workflow) modeling is the most critical step in Master Data Management.In this paper, we realize a Visual Modeling tool for implementing Repositories, Constraints and Processes based on Eclipse Plugin using GMF/EMF which follows principles of Model Driven Engineering (MDE). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=EMF" title="EMF">EMF</a>, <a href="https://publications.waset.org/abstracts/search?q=GMF" title=" GMF"> GMF</a>, <a href="https://publications.waset.org/abstracts/search?q=GEF" title=" GEF"> GEF</a>, <a href="https://publications.waset.org/abstracts/search?q=repository" title=" repository"> repository</a>, <a href="https://publications.waset.org/abstracts/search?q=constraint" title=" constraint"> constraint</a>, <a href="https://publications.waset.org/abstracts/search?q=process" title=" process"> process</a> </p> <a href="https://publications.waset.org/abstracts/21745/design-of-visual-repository-constraint-and-process-modeling-tool-based-on-eclipse-plug-ins" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21745.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">497</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">410</span> Model of Obstacle Avoidance on Hard Disk Drive Manufacturing with Distance Constraint </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rawinun%20Praserttaweelap">Rawinun Praserttaweelap</a>, <a href="https://publications.waset.org/abstracts/search?q=Somyot%20Kiatwanidvilai"> Somyot Kiatwanidvilai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Obstacle avoidance is the one key for the robot system in unknown environment. The robots should be able to know their position and safety region. This research starts on the path planning which are SLAM and AMCL in ROS system. In addition, the best parameters of the obstacle avoidance function are required. In situation on Hard Disk Drive Manufacturing, the distance between robots and obstacles are very serious due to the manufacturing constraint. The simulations are accomplished by the SLAM and AMCL with adaptive velocity and safety region calculation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=obstacle%20avoidance" title="obstacle avoidance">obstacle avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=OA" title=" OA"> OA</a>, <a href="https://publications.waset.org/abstracts/search?q=Simultaneous%20Localization%20and%20Mapping" title=" Simultaneous Localization and Mapping"> Simultaneous Localization and Mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=SLAM" title=" SLAM"> SLAM</a>, <a href="https://publications.waset.org/abstracts/search?q=Adaptive%20Monte%20Carlo%20Localization" title=" Adaptive Monte Carlo Localization"> Adaptive Monte Carlo Localization</a>, <a href="https://publications.waset.org/abstracts/search?q=AMCL" title=" AMCL"> AMCL</a>, <a href="https://publications.waset.org/abstracts/search?q=KLD%20sampling" title=" KLD sampling"> KLD sampling</a>, <a href="https://publications.waset.org/abstracts/search?q=KLD" title=" KLD"> KLD</a> </p> <a href="https://publications.waset.org/abstracts/87279/model-of-obstacle-avoidance-on-hard-disk-drive-manufacturing-with-distance-constraint" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87279.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">198</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">409</span> A Bi-Objective Model to Address Simultaneous Formulation of Project Scheduling and Material Ordering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Babak%20H.%20Tabrizi">Babak H. Tabrizi</a>, <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Farid%20Ghaderi"> Seyed Farid Ghaderi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Concurrent planning of project scheduling and material ordering has been increasingly addressed within last decades as an approach to improve the project execution costs. Therefore, we have taken the problem into consideration in this paper, aiming to maximize schedules quality robustness, in addition to minimize the relevant costs. In this regard, a bi-objective mathematical model is developed to formulate the problem. Moreover, it is possible to utilize the all-unit discount for materials purchasing. The problem is then solved by the constraint method, and the Pareto front is obtained for a variety of robustness values. The applicability and efficiency of the proposed model is tested by different numerical instances, finally. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=e-constraint%20method" title="e-constraint method">e-constraint method</a>, <a href="https://publications.waset.org/abstracts/search?q=material%20ordering" title=" material ordering"> material ordering</a>, <a href="https://publications.waset.org/abstracts/search?q=project%20management" title=" project management"> project management</a>, <a href="https://publications.waset.org/abstracts/search?q=project%20scheduling" title=" project scheduling"> project scheduling</a> </p> <a href="https://publications.waset.org/abstracts/40333/a-bi-objective-model-to-address-simultaneous-formulation-of-project-scheduling-and-material-ordering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40333.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">295</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=precedence%20constraint&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=precedence%20constraint&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=precedence%20constraint&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=precedence%20constraint&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=precedence%20constraint&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=precedence%20constraint&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=precedence%20constraint&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=precedence%20constraint&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=precedence%20constraint&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=precedence%20constraint&page=14">14</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=precedence%20constraint&page=15">15</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=precedence%20constraint&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>