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: one stop shop</title> <meta name="description" content="Search results for: one stop shop"> <meta name="keywords" content="one stop shop"> <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="one stop shop" 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="one stop shop"> <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> 534</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: one stop shop</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">534</span> Preventing Factors for Innovation: The Case of Swedish Construction Small and Medium-Sized Local Companies towards a One-Stop-Shop Business Concept</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Georgios%20Pardalis">Georgios Pardalis</a>, <a href="https://publications.waset.org/abstracts/search?q=Krushna%20Mahapatra"> Krushna Mahapatra</a>, <a href="https://publications.waset.org/abstracts/search?q=Brijesh%20Mainali"> Brijesh Mainali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Compared to other sectors, the residential and service sector in Sweden is responsible for almost 40% of the national final energy use and faces great challenges towards achieving reduction of energy intensity. The one- and two-family (henceforth 'detached') houses, constituting 60% of the residential floor area and using 32 TWh for space heating and hot water purposes, offers significant opportunities for improved energy efficiency. More than 80% of those houses are more than 35 years of old and a large share of them need major renovations. However, the rate of energy renovations for such houses is significantly low. The renovation market is dominated by small and medium-sized local companies (SMEs), who mostly offer individual solutions. A one-stop-shop business framework, where a single actor collaborates with other actors and coordinates them to offer a full package for holistic renovations, may speed up the rate of renovation. Such models are emerging in some European countries. This paper aims to understand the willingness of the SMEs to adopt a one-stop-shop business framework. Interviews were conducted with 13 SMEs in Kronoberg county in Sweden, a geographic region known for its initiatives towards sustainability and energy efficiency. The examined firms seem reluctant to adopt one-stop-shop for nonce due to the perceived risks they see in such a business move and due to their characteristics, although they agree that such a move will advance their position in the market and their business volume. By using threat-rigidity and prospect theory, we illustrate how this type of companies can move from being reluctant to adopt one-stop-shop framework to its adoption. Additionally, with the use of behavioral theory, we gain deeper knowledge on those exact reasons preventing those firms from adopting the one-stop-shop framework. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=construction%20SMEs" title="construction SMEs">construction SMEs</a>, <a href="https://publications.waset.org/abstracts/search?q=innovation%20adoption" title=" innovation adoption"> innovation adoption</a>, <a href="https://publications.waset.org/abstracts/search?q=one-stop-shop" title=" one-stop-shop"> one-stop-shop</a>, <a href="https://publications.waset.org/abstracts/search?q=perceived%20risks" title=" perceived risks"> perceived risks</a> </p> <a href="https://publications.waset.org/abstracts/103600/preventing-factors-for-innovation-the-case-of-swedish-construction-small-and-medium-sized-local-companies-towards-a-one-stop-shop-business-concept" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103600.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">126</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">533</span> Loading Methodology for a Capacity Constrained Job-Shop</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Viraj%20Tyagi">Viraj Tyagi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ajai%20Jain"> Ajai Jain</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20K.%20Jain"> P. K. Jain</a>, <a href="https://publications.waset.org/abstracts/search?q=Aarushi%20Jain"> Aarushi Jain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a genetic algorithm based loading methodology for a capacity constrained job-shop with the consideration of alternative process plans for each part to be produced. Performance analysis of the proposed methodology is carried out for two case studies by considering two different manufacturing scenarios. Results obtained indicate that the methodology is quite effective in improving the shop load balance, and hence, it can be included in the frameworks of manufacturing planning systems of job-shop oriented industries. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=manufacturing%20planning" title="manufacturing planning">manufacturing planning</a>, <a href="https://publications.waset.org/abstracts/search?q=loading" title=" loading"> loading</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=job%20shop" title=" job shop"> job shop</a> </p> <a href="https://publications.waset.org/abstracts/52652/loading-methodology-for-a-capacity-constrained-job-shop" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52652.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">302</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">532</span> Comparison of Due Date Assignment Rules in a Dynamic Job Shop</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mumtaz%20Ipek">Mumtaz Ipek</a>, <a href="https://publications.waset.org/abstracts/search?q=Burak%20Erkayman"> Burak Erkayman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due date is assigned as an input for scheduling problems. At the same time, due date is selected as a decision variable for real time scheduling applications. Correct determination of due dates increases shop floor performance and number of jobs completed on time. This subject has been mentioned widely in the literature. Moreover rules for due date determination have been developed from analytical analysis. When a job arrives to the shop floor, a due date is assigned for delivery. Various due date determination methods are used in the literature. In this study six different due date methods are implemented for a hypothetical dynamic job shop and the performances of the due date methods are compared. <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=dynamic%20job%20shop" title=" dynamic job shop"> dynamic job shop</a>, <a href="https://publications.waset.org/abstracts/search?q=due%20date%20assignment" title=" due date assignment"> due date assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=management%20engineering" title=" management engineering"> management engineering</a> </p> <a href="https://publications.waset.org/abstracts/28369/comparison-of-due-date-assignment-rules-in-a-dynamic-job-shop" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28369.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">531</span> Sociophonetic Conditioning of F0 Range Compression in Diasporic Nepali Communities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Neelam%20Chhetry">Neelam Chhetry</a>, <a href="https://publications.waset.org/abstracts/search?q=Indranil%20Dutta"> Indranil Dutta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The present study accounts for the fundamental frequency (f0) perturbations of stop types in Nepali spoken in the Maram region of Manipur, India. Two different experiments were performed on the speech of the native speakers of Nepali in order to investigate if the f0 perturbation following the stop types would be affected due to contact with tonal language, Maram. We found that the Nepali speakers maintained four way stop contrast: voiceless stop (VS), voiceless aspirated stop (VLAS), voiced stop (VS) and voiced aspirated stop (VAS) despite being in contact with Maramfor a very long time. We also found that the F0 range was greater for VAS leading to F0 compression for speakers with high level of proficiency (LOP) in Maram due to extensive language contact. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=F0" title="F0">F0</a>, <a href="https://publications.waset.org/abstracts/search?q=sociophonetic" title=" sociophonetic"> sociophonetic</a>, <a href="https://publications.waset.org/abstracts/search?q=F0%20range" title=" F0 range"> F0 range</a>, <a href="https://publications.waset.org/abstracts/search?q=sociophonetic" title=" sociophonetic"> sociophonetic</a> </p> <a href="https://publications.waset.org/abstracts/42268/sociophonetic-conditioning-of-f0-range-compression-in-diasporic-nepali-communities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42268.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">324</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">530</span> The Management Information System for Convenience Stores: Case Study in 7 Eleven Shop in Bangkok</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Supattra%20Kanchanopast">Supattra Kanchanopast</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this research is to develop and design a management information system for 7 eleven shop in Bangkok. The system was designed and developed to meet users’ requirements via the internet network by use of application software such as My SQL for database management, Apache HTTP Server for Web Server and PHP Hypertext Preprocessor for an interface between web server, database and users. The system was designed into two subsystems as the main system, or system for head office, and the branch system for branch shops. These consisted of three parts which are classified by user management as shop management, inventory management and Point of Sale (POS) management. The implementation of the MIS for the mini-mart shop, can lessen the amount of paperwork and reduce repeating tasks so it may decrease the capital of the business and support an extension of branches in the future as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convenience%20store" title="convenience store">convenience store</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20management%20information%20system" title=" the management information system"> the management information system</a>, <a href="https://publications.waset.org/abstracts/search?q=inventory%20management" title=" inventory management"> inventory management</a>, <a href="https://publications.waset.org/abstracts/search?q=7%20eleven%20shop" title=" 7 eleven shop"> 7 eleven shop</a> </p> <a href="https://publications.waset.org/abstracts/56141/the-management-information-system-for-convenience-stores-case-study-in-7-eleven-shop-in-bangkok" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56141.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">484</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">529</span> Beliefs in Auspicious Materials of Shop Entrepreneurs in Maung Hat Yai, Thailand</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Punya%20Tepsing">Punya Tepsing</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research aimed to study the beliefs in auspicious materials of entrepreneurs in Muang Hat Yai. The data were collected via documentary research and field work including interviews, observations shops in Hat Yai which used auspicious materials to bring lucks to the shops. The results were as follows. The beliefs in auspicious materials that the entrepreneurs had were of three areas: 1) The auspicious materials could correct the improperness of the shop location, for example, the shop situated opposite a branch road, a shrine, or a bank. The owner usually corrected it by putting Chinese auspicious materials in front of or in the shop, for example, a lion holding a sword in his mouth, or a mirror, etc. 2) The auspicious materials could bring in more income. The owner of the shop usually put the auspicious materials such as a cat beckoning and a bamboo fish trap believed to trap money in front of or inside the shop. 3) The auspicious materials like turtles, paired fish and a monster holding the moon in his mouth could solve life problems including health, family, and safety problems. The use of these auspicious materials showed the blending of the beliefs of the Chinese shop entrepreneurs with the Thai folk beliefs. What is interesting is that Hat Yai is located near the three southern border provinces which are the unrest area and this may cause the number of tourists to decline. This prompted them to build a mechanism in adjusting themselves both to save their lives and to increase the number of customers. Auspicious materials can make them feel more confident. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=belief" title="belief">belief</a>, <a href="https://publications.waset.org/abstracts/search?q=auspicious%20materials" title=" auspicious materials"> auspicious materials</a>, <a href="https://publications.waset.org/abstracts/search?q=shop" title=" shop"> shop</a>, <a href="https://publications.waset.org/abstracts/search?q=entrepreneur" title=" entrepreneur"> entrepreneur</a>, <a href="https://publications.waset.org/abstracts/search?q=Maung%20Hat%20Yai" title=" Maung Hat Yai"> Maung Hat Yai</a> </p> <a href="https://publications.waset.org/abstracts/3683/beliefs-in-auspicious-materials-of-shop-entrepreneurs-in-maung-hat-yai-thailand" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3683.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">241</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">528</span> Family Planning and HIV Integration: A One-stop Shop Model at Spilhaus Clinic, Harare Zimbabwe</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mercy%20Marimirofa">Mercy Marimirofa</a>, <a href="https://publications.waset.org/abstracts/search?q=Farai%20Machinga"> Farai Machinga</a>, <a href="https://publications.waset.org/abstracts/search?q=Alfred%20Zvoushe"> Alfred Zvoushe</a>, <a href="https://publications.waset.org/abstracts/search?q=Tsitsidzaishe%20Musvosvi"> Tsitsidzaishe Musvosvi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Government of Zimbabwe embarked on integrating family planning with Sexually Transmitted Infection (STI) and Human Immunodeficiency Virus (HIV) services in May 2020 with support from the World Health Organization (WHO). There was high HIV prevalence, incidence rates and STI infections among women attending FP clinics. Spilhaus is a specialized center of excellence clinic which offers a range of sexual reproductive health services. HIV services were limited to testing only, and clients were referred to other facilities for further management. Integration of services requires that all the services be available at one point so that clients will access them during their visit to the facility. Objectives: The study was conducted to assess the impact the one-stop-shop model has made in accessing integrated Family Planning services and sexual reproductive health services compared to the supermarket approach. It also assessed the relationship family planning services have with other sexual reproductive health services. Methods: A secondary data analysis was conducted at Spilhaus clinic in Harare using family planning registers and HIV services registers comparing years 2019 and 2021. A 2 sample t-test was used to determine the difference in clients accessing the services under the two models. A Spearman’s rank correlation was used to determine if accessing family planning services has a relationship with other sexual reproductive health services. Results: In 2019, 7,548 clients visited the Spilhaus clinic compared to 8,265 during the period January to December 2021. The median age for all clients accessing services was 32 years. An increase of 69% in the number of services accessed was recorded from 2019 to 2021. More services were accessed in 2021. There was no difference in the number of clients accessing family planning services cervical cancer, and HIV services. A difference was found in the number of clients who were offered STI screening services. There was also a relationship between accessing family planning services and STI screening services (ρ = 0.729, p-value=0.006). Conclusion: Programming towards SRH services was a great achievement, the use of an integrated approach proved to be cost-effective as it minimised the required resources for separate programs. Clients accessed important health needs at once. The integration of these services provided an opportunity to offer comprehensive information which addressed an individual’s sexual reproductive health needs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=intergration" title="intergration">intergration</a>, <a href="https://publications.waset.org/abstracts/search?q=one%20stop%20shop" title=" one stop shop"> one stop shop</a>, <a href="https://publications.waset.org/abstracts/search?q=family%20planning" title=" family planning"> family planning</a>, <a href="https://publications.waset.org/abstracts/search?q=reproductive%20health" title=" reproductive health"> reproductive health</a> </p> <a href="https://publications.waset.org/abstracts/177927/family-planning-and-hiv-integration-a-one-stop-shop-model-at-spilhaus-clinic-harare-zimbabwe" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/177927.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">527</span> Trends in Solving Assembly Job Shop Scheduling Problem: A Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Midhun%20Paul">Midhun Paul</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Radha%20Ramanan"> T. Radha Ramanan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of this work is to present a state-of-the-art literature review highlighting the challenges in the research of the scheduling of assembly job shop problem and providing an insight on how the future directions of the research would be. The number of work has been substantial that it requires a review to enable one to understand the origin of the research and how it is getting evolved. This review paper presents a comprehensive review of the literature dealing with various studies carried on assembly job shop scheduling. The review details the evolution of the AJS from the perspective of other scheduling problems and also presents a classification scheme. The work also identifies the potential directions for future research, which we believe to be worthwhile considering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=assembly%20job%20shop" title="assembly job shop">assembly job shop</a>, <a href="https://publications.waset.org/abstracts/search?q=future%20directions" title=" future directions"> future directions</a>, <a href="https://publications.waset.org/abstracts/search?q=manufacturing" title=" manufacturing"> manufacturing</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a> </p> <a href="https://publications.waset.org/abstracts/2449/trends-in-solving-assembly-job-shop-scheduling-problem-a-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2449.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">413</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">526</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">190</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">525</span> Kinetic Evaluation of Biodegradability of Paint Shop Wastewater of a Bus Production Factory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Didem%20G%C3%BCven">Didem Güven</a>, <a href="https://publications.waset.org/abstracts/search?q=Oytun%20Hanhan"> Oytun Hanhan</a>, <a href="https://publications.waset.org/abstracts/search?q=Elif%20Ceren%20Aksoy"> Elif Ceren Aksoy</a>, <a href="https://publications.waset.org/abstracts/search?q=Emine%20Ubay%20%C3%87okg%C3%B6r"> Emine Ubay Çokgör</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a biological treatability study ofpaintshopwastewaterof a bus factory by an anoxic/aerobic sequencing batch reactor.A lab scale 14L SBR system was implementedto investigate carbon and nitrogen removal performance frompaint shop waste streams combined with domestic and process wastewater of a bus production factory in Istanbul (Turkey).The wastewater collected from decanters of the paint boots and pre-treatmentplant was usedforthefeeding of SBR. The reactor was operated with a total hydraulic retention time of 24 hrs, and a total sludge age of 18.7 days. Initially the efficiency and stability of the reactor were studied when fed with main wastewater stream to simulate the current wastewater treatment plant. Removal efficiency of 57% nitrogen and 90% COD were obtained. Once the paint shop wastewater was introduced to mainstream feeding with a ratio of 1:5, nitrification completely, carbon removal were partially inhibited. SBR system was successful to handle even at very high COD concentrations of paint shop wastewater after feeding of 2 months, with an average effluent COD of 100 mg/L. For the determination of kinetic parameters, respirometric analysis was also conducted with/without paint shop wastewater addition. Model simulation indicated lower maximum specific growth and hydrolysis rates when paint shop wastewater was mixed with the mainstream wastewater of the factory. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biological%20treatability" title="biological treatability">biological treatability</a>, <a href="https://publications.waset.org/abstracts/search?q=nitrogen%20removal" title=" nitrogen removal"> nitrogen removal</a>, <a href="https://publications.waset.org/abstracts/search?q=paint%20shop%20wastewater" title=" paint shop wastewater"> paint shop wastewater</a>, <a href="https://publications.waset.org/abstracts/search?q=sequencing%20batch%20reactor" title=" sequencing batch reactor"> sequencing batch reactor</a> </p> <a href="https://publications.waset.org/abstracts/44831/kinetic-evaluation-of-biodegradability-of-paint-shop-wastewater-of-a-bus-production-factory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44831.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">296</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">524</span> A Framework of Dynamic Rule Selection Method for Dynamic Flexible Job Shop Problem by Reinforcement Learning Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rui%20Wu">Rui Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the volatile modern manufacturing environment, new orders randomly occur at any time, while the pre-emptive methods are infeasible. This leads to a real-time scheduling method that can produce a reasonably good schedule quickly. The dynamic Flexible Job Shop problem is an NP-hard scheduling problem that hybrid the dynamic Job Shop problem with the Parallel Machine problem. A Flexible Job Shop contains different work centres. Each work centre contains parallel machines that can process certain operations. Many algorithms, such as genetic algorithms or simulated annealing, have been proposed to solve the static Flexible Job Shop problems. However, the time efficiency of these methods is low, and these methods are not feasible in a dynamic scheduling problem. Therefore, a dynamic rule selection scheduling system based on the reinforcement learning method is proposed in this research, in which the dynamic Flexible Job Shop problem is divided into several parallel machine problems to decrease the complexity of the dynamic Flexible Job Shop problem. Firstly, the features of jobs, machines, work centres, and flexible job shops are selected to describe the status of the dynamic Flexible Job Shop problem at each decision point in each work centre. Secondly, a framework of reinforcement learning algorithm using a double-layer deep Q-learning network is applied to select proper composite dispatching rules based on the status of each work centre. Then, based on the selected composite dispatching rule, an available operation is selected from the waiting buffer and assigned to an available machine in each work centre. Finally, the proposed algorithm will be compared with well-known dispatching rules on objectives of mean tardiness, mean flow time, mean waiting time, or mean percentage of waiting time in the real-time Flexible Job Shop problem. The result of the simulations proved that the proposed framework has reasonable performance and time efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20scheduling%20problem" title="dynamic scheduling problem">dynamic scheduling problem</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=dispatching%20rules" title=" dispatching rules"> dispatching rules</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20reinforcement%20learning" title=" deep reinforcement learning"> deep reinforcement learning</a> </p> <a href="https://publications.waset.org/abstracts/159322/a-framework-of-dynamic-rule-selection-method-for-dynamic-flexible-job-shop-problem-by-reinforcement-learning-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159322.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">108</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">523</span> A Hybrid Distributed Algorithm for Solving 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=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a distributed hybrid algorithm is proposed for solving the job shop scheduling problem. The suggested method executes different artificial neural networks, heuristics and meta-heuristics simultaneously on more than one machine. The neural networks are used to control the constraints of the problem while the meta-heuristics search the global space and the heuristics are used to prevent the premature convergence. To attain an efficient distributed intelligent method for solving big and distributed job shop scheduling problems, Apache Spark and Hadoop frameworks are used. In the algorithm implementation and design steps, new approaches are applied. Comparison between the proposed algorithm and other efficient algorithms from the literature shows its efficiency, which is able to solve large size problems in short time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20algorithms" title="distributed algorithms">distributed algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Apache%20Spark" title=" Apache Spark"> Apache Spark</a>, <a href="https://publications.waset.org/abstracts/search?q=Hadoop" title=" Hadoop"> Hadoop</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20shop%20scheduling" title=" job shop scheduling"> job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a> </p> <a href="https://publications.waset.org/abstracts/72320/a-hybrid-distributed-algorithm-for-solving-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72320.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">387</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">522</span> A Metaheuristic for the Layout and Scheduling Problem in a Job Shop Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hern%C3%A1ndez%20Eva%20Selene">Hernández Eva Selene</a>, <a href="https://publications.waset.org/abstracts/search?q=Reyna%20Mary%20Carmen"> Reyna Mary Carmen</a>, <a href="https://publications.waset.org/abstracts/search?q=Rivera%20H%C3%A9ctor"> Rivera Héctor</a>, <a href="https://publications.waset.org/abstracts/search?q=Barrag%C3%A1n%20%20Irving"> Barragán Irving</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose an approach that jointly addresses the layout of a facility and the scheduling of a sequence of jobs. In real production, these two problems are interrelated. However, they are treated separately in the literature. Our approach is an extension of the job shop problem with transportation delay, where the location of the machines is selected among possible sites. The model minimizes the makespan, using the short processing times rule with two algorithms; the first one considers all the permutations for the location of machines, and the second only a heuristic to select some specific permutations that reduces computational time. Some instances are proved and compared with literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=layout%20problem" title="layout problem">layout problem</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20shop%20scheduling%20problem" title=" job shop scheduling problem"> job shop scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=concurrent%20scheduling%20and%20layout%20problem" title=" concurrent scheduling and layout problem"> concurrent scheduling and layout problem</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a> </p> <a href="https://publications.waset.org/abstracts/31639/a-metaheuristic-for-the-layout-and-scheduling-problem-in-a-job-shop-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31639.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">609</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">521</span> A Memetic Algorithm for an Energy-Costs-Aware 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=Christian%20B%C3%B6ning">Christian Böning</a>, <a href="https://publications.waset.org/abstracts/search?q=Henrik%20Prinzhorn"> Henrik Prinzhorn</a>, <a href="https://publications.waset.org/abstracts/search?q=Eric%20C.%20Hund"> Eric C. Hund</a>, <a href="https://publications.waset.org/abstracts/search?q=Malte%20Stonis"> Malte Stonis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, the flexible job-shop scheduling problem is extended by consideration of energy costs which arise owing to the power peak, and further decision variables such as work in process and throughput time are incorporated into the objective function. This enables a production plan to be simultaneously optimized in respect of the real arising energy and logistics costs. The energy-costs-aware flexible job-shop scheduling problem (EFJSP) which arises is described mathematically, and a memetic algorithm (MA) is presented as a solution. In the MA, the evolutionary process is supplemented with a local search. Furthermore, repair procedures are used in order to rectify any infeasible solutions that have arisen in the evolutionary process. The potential for lowering the real arising costs of a production plan through consideration of energy consumption levels is highlighted. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy%20costs" title="energy costs">energy costs</a>, <a href="https://publications.waset.org/abstracts/search?q=flexible%20job-shop%20scheduling" title=" flexible job-shop scheduling"> flexible job-shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=memetic%20algorithm" title=" memetic algorithm"> memetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20peak" title=" power peak"> power peak</a> </p> <a href="https://publications.waset.org/abstracts/69892/a-memetic-algorithm-for-an-energy-costs-aware-flexible-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69892.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">345</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">520</span> A Genetic Algorithm to Schedule the Flow Shop Problem under Preventive Maintenance Activities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Kaabi">J. Kaabi</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Harrath"> Y. Harrath</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studied the flow shop scheduling problem under machine availability constraints. The machines are subject to flexible preventive maintenance activities. The nonresumable scenario for the jobs was considered. That is, when a job is interrupted by an unavailability period of a machine it should be restarted from the beginning. The objective is to minimize the total tardiness time for the jobs and the advance/tardiness for the maintenance activities. To solve the problem, a genetic algorithm was developed and successfully tested and validated on many problem instances. The computational results showed that the new genetic algorithm outperforms another earlier proposed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flow%20shop%20scheduling" title="flow shop scheduling">flow shop scheduling</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=maintenance" title=" maintenance"> maintenance</a>, <a href="https://publications.waset.org/abstracts/search?q=priority%20rules" title=" priority rules"> priority rules</a> </p> <a href="https://publications.waset.org/abstracts/38002/a-genetic-algorithm-to-schedule-the-flow-shop-problem-under-preventive-maintenance-activities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38002.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">471</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">519</span> Irrelevant Angry Faces, Compared to Happy Faces, Facilitate the Response Inhibition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rashmi%20Gupta">Rashmi Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is unclear whether arousal or valence modulates the response inhibition process. It has been suggested that irrelevant positive emotional information (e.g., happy faces) and negative emotional information (e.g., angry faces) interact with attention differently. In the present study, we used arousal-matched irrelevant happy and angry faces. These faces were used as stop-signals in the stop-signal paradigm. There were two kinds of trials: go-trials and stop-trials. Participants were required to discriminate between the letter X or O by pressing the corresponding keys on go-trials. However, a stop signal was occasionally presented on stop trials, where participants were required to withhold their motor response. A significant main effect of emotion on response inhibition was observed. It indicated that the valence of a stop signal modulates inhibitory control. We found that stop-signal reaction time was faster in response to irrelevant angry faces than happy faces, indicating that irrelevant angry faces facilitate the response inhibition process compared to happy faces. These results shed light on the interaction of emotion with cognitive control functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=attention" title="attention">attention</a>, <a href="https://publications.waset.org/abstracts/search?q=emotion" title=" emotion"> emotion</a>, <a href="https://publications.waset.org/abstracts/search?q=response%20inhibition" title=" response inhibition"> response inhibition</a>, <a href="https://publications.waset.org/abstracts/search?q=inhibitory%20control" title=" inhibitory control"> inhibitory control</a> </p> <a href="https://publications.waset.org/abstracts/150097/irrelevant-angry-faces-compared-to-happy-faces-facilitate-the-response-inhibition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150097.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">105</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">518</span> Rescheduling of Manufacturing Flow Shop under Different Types of Disruption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Ndeley">M. Ndeley</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Now our days, Almost all manufacturing facilities need to use production planning and scheduling systems to increase productivity and to reduce production costs. Real-life production operations are subject to a large number of unexpected disruptions that may invalidate the original schedules. In these cases, rescheduling is essential to minimize the impact on the performance of the system. In this work we consider flow shop layouts that have seldom been studied in the rescheduling literature. We generate and employ three types of disruption that interrupt the original schedules simultaneously. We develop rescheduling algorithms to finally accomplish the twofold objective of establishing a standard framework on the one hand; and proposing rescheduling methods that seek a good trade-off between schedule quality and stability on the other. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flow%20shop%20scheduling" title="flow shop scheduling">flow shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertainty" title=" uncertainty"> uncertainty</a>, <a href="https://publications.waset.org/abstracts/search?q=rescheduling" title=" rescheduling"> rescheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=stability" title=" stability"> stability</a> </p> <a href="https://publications.waset.org/abstracts/30252/rescheduling-of-manufacturing-flow-shop-under-different-types-of-disruption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30252.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">440</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">517</span> Job Shop Scheduling: Classification, Constraints and Objective Functions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Majid%20Abdolrazzagh-Nezhad">Majid Abdolrazzagh-Nezhad</a>, <a href="https://publications.waset.org/abstracts/search?q=Salwani%20Abdullah"> Salwani Abdullah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The job-shop scheduling problem (JSSP) is an important decision facing those involved in the fields of industry, economics and management. This problem is a class of combinational optimization problem known as the NP-hard problem. JSSPs deal with a set of machines and a set of jobs with various predetermined routes through the machines, where the objective is to assemble a schedule of jobs that minimizes certain criteria such as makespan, maximum lateness, and total weighted tardiness. Over the past several decades, interest in meta-heuristic approaches to address JSSPs has increased due to the ability of these approaches to generate solutions which are better than those generated from heuristics alone. This article provides the classification, constraints and objective functions imposed on JSSPs that are available in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=job-shop%20scheduling" title="job-shop scheduling">job-shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification"> classification</a>, <a href="https://publications.waset.org/abstracts/search?q=constraints" title=" constraints"> constraints</a>, <a href="https://publications.waset.org/abstracts/search?q=objective%20functions" title=" objective functions"> objective functions</a> </p> <a href="https://publications.waset.org/abstracts/58284/job-shop-scheduling-classification-constraints-and-objective-functions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58284.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">446</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">516</span> Accounting Management Information System for Convenient Shop in Bangkok Thailand</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anocha%20Rojanapanich">Anocha Rojanapanich</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this research is to develop and design an accounting management information system for convenient shop in Bangkok Thailand. The study applied the System Development Life Cycle (SDLC) for development which began with study and analysis of current data, including the existing system. Then, the system was designed and developed to meet users’ requirements via the internet network by use of application software such as My SQL for database management, Product diversity, Apache HTTP Server for Web Server and PHP Hypertext Preprocessor for an interface between web server, database and users. The system was designed into two subsystems as the main system, or system for head office, and the branch system for branch shops. These consisted of three parts which are classified by user management as shop management, inventory management and Point of Sale (POS) management and importance of cost information for decision making also as well as. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accounting%20management%20information%20system" title="accounting management information system">accounting management information system</a>, <a href="https://publications.waset.org/abstracts/search?q=convenient%20shop" title=" convenient shop"> convenient shop</a>, <a href="https://publications.waset.org/abstracts/search?q=cost%20information%20for%20decision%20making%20system" title=" cost information for decision making system"> cost information for decision making system</a>, <a href="https://publications.waset.org/abstracts/search?q=development%20life%20cycle" title=" development life cycle"> development life cycle</a> </p> <a href="https://publications.waset.org/abstracts/49364/accounting-management-information-system-for-convenient-shop-in-bangkok-thailand" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49364.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">420</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">515</span> Genetic Algorithm for Solving the 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=Guilherme%20Baldo%20Carlos">Guilherme Baldo Carlos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The flexible job-shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which can be applied to model several applications in a wide array of industries. This problem will have its importance increase due to the shift in the production mode that modern society is going through. The demands are increasing and for products personalized and customized. This work aims to apply a meta-heuristic called a genetic algorithm (GA) to solve this problem. A GA is a meta-heuristic inspired by the natural selection of Charles Darwin; it produces a population of individuals (solutions) and selects, mutates, and mates the individuals through generations in order to find a good solution for the problem. The results found indicate that the GA is suitable for FJSP solving. <p class="card-text"><strong>Keywords:</strong> <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=evolutionary%20algorithm" title=" evolutionary algorithm"> evolutionary algorithm</a>, <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-shop%20scheduling" title=" flexible job-shop scheduling"> flexible job-shop scheduling</a> </p> <a href="https://publications.waset.org/abstracts/132314/genetic-algorithm-for-solving-the-flexible-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132314.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">147</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">514</span> Reducing Tobacco Consumption in a Rural Village of Sri Lanka Though a Community Based Health Promotion Intervention</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20A.%20N.%20Madubashini">B. A. N. Madubashini</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Anojan"> S. Anojan</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Thurka"> S. Thurka</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20M.%20C.%20J.%20Nawasinghe"> N. M. C. J. Nawasinghe</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20A.%20S.%20Milanga"> G. A. S. Milanga</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20M.%20I.%20S.%20Weerakoon"> W. M. I. S. Weerakoon</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20D.%20N.%20Ihalahewage"> I. D. N. Ihalahewage</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Evidence-based health promotional approaches are known to be successful ways of reducing tobacco consumption in a rural village. Hence tobacco prevention is essential in improving lives of people, and community-based approaches are considered as effective. This community-based health promotion intervention implemented to reduce high consumption of tobacco in a rural area in Sri Lanka. This intervention was conducted in a rural village of Sri Lanka. In the beginning, facilitation discussions conducted with community members to identify determinants leading to tobacco consumption among villagers. Intervention was planed based on those determinants. Community actions through small active groups to demote smoking were generated. Children groups displayed cigarette buds collected around common places such as temple to community gatherings including funeral welfare society elaborating the cost and the money spent on cigarettes. A till (expenditure box) was introduced, and smokers in family were encouraged to put money on a cigarette to it when they decide to smoke instead. This way they could monitor potential savings if quit. Children groups introduced a tool 'Engalanthe puthata (for overseas son)' to shops. Shop owners agreed to add a pebble to a box whenever they sell a cigarette. The money spent on cigarettes in that shop was calculated regularly, and that was considered as money sent to tobacco company overseas, so to the son of the company owner. This was useful to encourage quitting and to stop selling cigarette in the shops. All four shops in the community volunteered to stop selling cigarettes. Eleven percent of users quitted smoking and 37% users reduced smoking. Child empowerment was high, and 60% of children had shown their disapproval on smoking publicly at least once. Similar community-based health promotion intervention can be used to generate community actions leading to reduction of tobacco consumption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cigarette" title="cigarette">cigarette</a>, <a href="https://publications.waset.org/abstracts/search?q=community" title=" community"> community</a>, <a href="https://publications.waset.org/abstracts/search?q=empowerment" title=" empowerment"> empowerment</a>, <a href="https://publications.waset.org/abstracts/search?q=health%20promotion" title=" health promotion"> health promotion</a>, <a href="https://publications.waset.org/abstracts/search?q=intervention" title=" intervention"> intervention</a> </p> <a href="https://publications.waset.org/abstracts/93077/reducing-tobacco-consumption-in-a-rural-village-of-sri-lanka-though-a-community-based-health-promotion-intervention" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93077.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">229</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">513</span> Ammonia Release during Photocopying Operations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kiurski%20S.%20Jelena">Kiurski S. Jelena</a>, <a href="https://publications.waset.org/abstracts/search?q=Keci%C4%87%20S.%20Vesna"> Kecić S. Vesna</a>, <a href="https://publications.waset.org/abstracts/search?q=Oros%20B.%20Ivana"> Oros B. Ivana</a>, <a href="https://publications.waset.org/abstracts/search?q=Ranogajec%20G.%20Jonjaua"> Ranogajec G. Jonjaua</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper represents the dependence of ammonia concentration on microclimate parameters and photocopying shop circulation. The concentration of ammonia was determined during 8-hours working time over five days including three sampling points of a photocopying shop in Novi Sad, Serbia. The obtained results pointed out that the room temperature possesses the highest impact on ammonia release. The obtained ammonia concentration was in the range of 1.53 to 0.42ppm and decreased with the temperature decreasing from 24.6 to 20.7 °C. As the detected concentrations were within the permissible levels of The Occupational Safety and Health Administration, The National Institute for Occupational Safety and The Health and Official Gazette of Republic of Serbia, in the range of 35 to 200ppm, there was no danger to the employee’s health in the photocopying shop. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ammonia" title="ammonia">ammonia</a>, <a href="https://publications.waset.org/abstracts/search?q=emission" title=" emission"> emission</a>, <a href="https://publications.waset.org/abstracts/search?q=indoor%20environment" title=" indoor environment"> indoor environment</a>, <a href="https://publications.waset.org/abstracts/search?q=photocopying%20procedure" title=" photocopying procedure"> photocopying procedure</a> </p> <a href="https://publications.waset.org/abstracts/3684/ammonia-release-during-photocopying-operations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3684.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">405</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">512</span> Computed Tomography Myocardial Perfusion on a Patient with Hypertrophic Cardiomyopathy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jitendra%20Pratap">Jitendra Pratap</a>, <a href="https://publications.waset.org/abstracts/search?q=Daphne%20Prybyszcuk"> Daphne Prybyszcuk</a>, <a href="https://publications.waset.org/abstracts/search?q=Luke%20Elliott"> Luke Elliott</a>, <a href="https://publications.waset.org/abstracts/search?q=Arnold%20Ng"> Arnold Ng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Introduction: Coronary CT angiography is a non-invasive imaging technique for the assessment of coronary artery disease and has high sensitivity and negative predictive value. However, the correlation between the degree of CT coronary stenosis and the significance of hemodynamic obstruction is poor. The assessment of myocardial perfusion has mostly been undertaken by Nuclear Medicine (SPECT), but it is now possible to perform stress myocardial CT perfusion (CTP) scans quickly and effectively using CT scanners with high temporal resolution. Myocardial CTP is in many ways similar to neuro perfusion imaging technique, where radiopaque iodinated contrast is injected intravenously, transits the pulmonary and cardiac structures, and then perfuses through the coronary arteries into the myocardium. On the Siemens Force CT scanner, a myocardial perfusion scan is performed using a dynamic axial acquisition, where the scanner shuffles in and out every 1-3 seconds (heart rate dependent) to be able to cover the heart in the z plane. This is usually performed over 38 seconds. Report: A CT myocardial perfusion scan can be utilised to complement the findings of a CT Coronary Angiogram. Implementing a CT Myocardial Perfusion study as part of a routine CT Coronary Angiogram procedure provides a ‘One Stop Shop’ for diagnosis of coronary artery disease. This case study demonstrates that although the CT Coronary Angiogram was within normal limits, the perfusion scan provided additional, clinically significant information in regards to the haemodynamics within the myocardium of a patient with Hypertrophic Obstructive Cardio Myopathy (HOCM). This negated the need for further diagnostics studies such as cardiac ECHO or Nuclear Medicine Stress tests. Conclusion: CT coronary angiography with adenosine stress myocardial CTP was utilised in this case to specifically exclude coronary artery disease in conjunction with accessing perfusion within the hypertrophic myocardium. Adenosine stress myocardial CTP demonstrated the reduced myocardial blood flow within the hypertrophic myocardium, but the coronary arteries did not show any obstructive disease. A CT coronary angiogram scan protocol that incorporates myocardial perfusion can provide diagnostic information on the haemodynamic significance of any coronary artery stenosis and has the potential to be a “One Stop Shop” for cardiac imaging. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CT" title="CT">CT</a>, <a href="https://publications.waset.org/abstracts/search?q=cardiac" title=" cardiac"> cardiac</a>, <a href="https://publications.waset.org/abstracts/search?q=myocardium" title=" myocardium"> myocardium</a>, <a href="https://publications.waset.org/abstracts/search?q=perfusion" title=" perfusion"> perfusion</a> </p> <a href="https://publications.waset.org/abstracts/152373/computed-tomography-myocardial-perfusion-on-a-patient-with-hypertrophic-cardiomyopathy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152373.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">132</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">511</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">510</span> A Reactive Flexible Job Shop Scheduling Model in a Stochastic Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Majid%20Khalili">Majid Khalili</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamed%20Tayebi"> Hamed Tayebi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers a stochastic flexible job-shop scheduling (SFJSS) problem in the presence of production disruptions, and reactive scheduling is implemented in order to find the optimal solution under uncertainty. In this problem, there are two main disruptions including machine failure which influences operation time, and modification or cancellation of the order delivery date during production. In order to decrease the negative effects of these difficulties, two derived strategies from reactive scheduling are used; the first one is relevant to being able to allocate multiple machine to each job, and the other one is related to being able to select the best alternative process from other job while some disruptions would be created in the processes of a job. For this purpose, a Mixed Integer Linear Programming model is proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flexible%20job-shop%20scheduling" title="flexible job-shop scheduling">flexible job-shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=reactive%20scheduling" title=" reactive scheduling"> reactive scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20environment" title=" stochastic environment"> stochastic environment</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20linear%20programming" title=" mixed integer linear programming"> mixed integer linear programming</a> </p> <a href="https://publications.waset.org/abstracts/69932/a-reactive-flexible-job-shop-scheduling-model-in-a-stochastic-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69932.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">361</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">509</span> A Hybrid Hopfield Neural Network for Dynamic Flexible Job Shop Scheduling Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new hybrid Hopfield neural network is proposed for the dynamic, flexible job shop scheduling problem. A new heuristic based and easy to implement energy function is designed for the Hopfield neural network, which penalizes the constraints violation and decreases makespan. Moreover, for enhancing the performance, several heuristics are integrated to it that achieve active, and non-delay schedules also, prevent early convergence of the neural network. The suggested algorithm that is designed as a generalization of the previous studies for the flexible and dynamic scheduling problems can be used for solving real scheduling problems. Comparison of the presented hybrid method results with the previous studies results proves its efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20flexible%20job%20shop%20scheduling" title="dynamic flexible job shop scheduling">dynamic flexible job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=constrained%20optimization" title=" constrained optimization"> constrained optimization</a> </p> <a href="https://publications.waset.org/abstracts/72143/a-hybrid-hopfield-neural-network-for-dynamic-flexible-job-shop-scheduling-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72143.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">508</span> Analysis of Eating Habits of Working People in Shopping Centers on a 12-Hour Basis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Sadowska">A. Sadowska</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Polaniak"> R. Polaniak</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Boczarski"> P. Boczarski</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Grochowska-Niedworok"> E. Grochowska-Niedworok</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Working in a shopping center 12 hours a day as a shop assistant is a very demanding and stressful job, which is still underestimated. Proper eating habits, including recommended fruits, vegetables, products rich in fiber, omega-3 fatty acids, and proper hydration, can contribute to improvement in health and make shop assistants more resistant to stress. The aim of this study was to analyze the eating habits of shop assistants working in shopping centers 12 hours a day. Participant 101 sellers from Poland filled out authorial surveys. Nearly 50% of participants consumed the recommended number of 4 to 5 meals per day. There was a slight dependence between the number of meals consumed per day and the time that employers allowed for employee mealtimes. Respondents declared that they engaged in snacking, and they generally chose fruit, chocolates, and other sweets. Survey results indicated a low liquid intake, which was about 1,05 liters daily. Mineral water was chosen most often (63%) by participants. Participant fish consumption was very low in comparison with the norms, which can pose a risk of developing omega-3 fatty acids deficiency. Shop assistants stated that a change in their eating habits was necessary. Study findings suggest a moderate dependence between being on a diet and counting calories and macronutrients contained in meals. The number of meals eaten per day is correlated with the number of meals eaten at the worksite. The percentage of snacking by shop assistants was so high that it suggested a need for more nutrition education. The topic of eating habits among shop assistants should be examined using a larger group of participants. It is necessary to note a connection between nutrition and health problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=eating%20habits" title="eating habits">eating habits</a>, <a href="https://publications.waset.org/abstracts/search?q=work%20during%2012%20hours%20a%20day" title=" work during 12 hours a day"> work during 12 hours a day</a>, <a href="https://publications.waset.org/abstracts/search?q=shopping%20center" title=" shopping center"> shopping center</a>, <a href="https://publications.waset.org/abstracts/search?q=nutrition" title=" nutrition"> nutrition</a> </p> <a href="https://publications.waset.org/abstracts/115177/analysis-of-eating-habits-of-working-people-in-shopping-centers-on-a-12-hour-basis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/115177.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">122</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">507</span> A Constrained Neural Network Based Variable Neighborhood Search for the Multi-Objective Dynamic Flexible Job Shop Scheduling Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a>, <a href="https://publications.waset.org/abstracts/search?q=Ozan%20Bahadir"> Ozan Bahadir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new neural network based variable neighborhood search is proposed for the multi-objective dynamic, flexible job shop scheduling problems. The neural network controls the problems' constraints to prevent infeasible solutions, while the Variable Neighborhood Search (VNS) applies moves, based on the critical block concept to improve the solutions. Two approaches are used for managing the constraints, in the first approach, infeasible solutions are modified according to the constraints, after the moves application, while in the second one, infeasible moves are prevented. Several neighborhood structures from the literature with some modifications, also new structures are used in the VNS. The suggested neighborhoods are more systematically defined and easy to implement. Comparison is done based on a multi-objective flexible job shop scheduling problem that is dynamic because of the jobs different release time and machines breakdowns. The results show that the presented method has better performance than the compared VNSs selected from the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constrained%20optimization" title="constrained optimization">constrained optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20neighborhood%20search" title=" variable neighborhood search"> variable neighborhood search</a>, <a href="https://publications.waset.org/abstracts/search?q=flexible%20job%20shop%20scheduling" title=" flexible job shop scheduling"> flexible job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20multi-objective%20optimization" title=" dynamic multi-objective optimization"> dynamic multi-objective optimization</a> </p> <a href="https://publications.waset.org/abstracts/71919/a-constrained-neural-network-based-variable-neighborhood-search-for-the-multi-objective-dynamic-flexible-job-shop-scheduling-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71919.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">346</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">506</span> A Hybrid Tabu Search Algorithm for the Multi-Objective Job Shop Scheduling Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a hybrid Tabu Search (TS) algorithm is suggested for the multi-objective job shop scheduling problems (MO-JSSPs). The algorithm integrates several shifting bottleneck based neighborhood structures with the Giffler & Thompson algorithm, which improve efficiency of the search. Diversification and intensification are provided with local and global left shift algorithms application and also new semi-active, active, and non-delay schedules creation. The suggested algorithm is tested in the MO-JSSPs benchmarks from the literature based on the Pareto optimality concept. Different performances criteria are used for the multi-objective algorithm evaluation. The proposed algorithm is able to find the Pareto solutions of the test problems in shorter time than other algorithm of the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=tabu%20search" title="tabu search">tabu search</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20shop%20scheduling" title=" job shop scheduling"> job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Pareto%20optimality" title=" Pareto optimality"> Pareto optimality</a> </p> <a href="https://publications.waset.org/abstracts/71920/a-hybrid-tabu-search-algorithm-for-the-multi-objective-job-shop-scheduling-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71920.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">443</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">505</span> A High-Level Co-Evolutionary Hybrid Algorithm for the Multi-Objective 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=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a hybrid distributed algorithm has been suggested for the multi-objective job shop scheduling problem. Many new approaches are used at design steps of the distributed algorithm. Co-evolutionary structure of the algorithm and competition between different communicated hybrid algorithms, which are executed simultaneously, causes to efficient search. Using several machines for distributing the algorithms, at the iteration and solution levels, increases computational speed. The proposed algorithm is able to find the Pareto solutions of the big problems in shorter time than other algorithm in the literature. Apache Spark and Hadoop platforms have been used for the distribution of the algorithm. The suggested algorithm and implementations have been compared with results of the successful algorithms in the literature. Results prove the efficiency and high speed of the algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20algorithms" title="distributed algorithms">distributed algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Apache%20Spark" title=" Apache Spark"> Apache Spark</a>, <a href="https://publications.waset.org/abstracts/search?q=Hadoop" title=" Hadoop"> Hadoop</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20shop%20scheduling" title=" job shop scheduling"> job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a> </p> <a href="https://publications.waset.org/abstracts/72317/a-high-level-co-evolutionary-hybrid-algorithm-for-the-multi-objective-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72317.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">363</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=one%20stop%20shop&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=one%20stop%20shop&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=one%20stop%20shop&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=one%20stop%20shop&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=one%20stop%20shop&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=one%20stop%20shop&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=one%20stop%20shop&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=one%20stop%20shop&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=one%20stop%20shop&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=one%20stop%20shop&page=17">17</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=one%20stop%20shop&page=18">18</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=one%20stop%20shop&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>