34 research outputs found

    Adaptation and parameters studies of CS algorithm for flow shop scheduling problem

    Get PDF
    Scheduling concerns the allocation of limited resources overtime to perform tasks to fulfill certain criterion and optimize one or several objective functions. One of the most popular models in scheduling theory is that of the flow-shop scheduling. During the last 40 years, the permutation flow-shop sequencing problem with the objective of makespan minimization has held the attraction of many researchers. This problem characterized as Fm/prmu/Cmax in the notation of Graham, involves the determination of the order of processing of n jobs on m machines. In addition, there was evidence that m-machine permutation flow-shop scheduling problem (PFSP) is strongly NP-hard for m ≥3. Due to this NP-hardness, many heuristic approaches have been proposed, this work falls within the framework of the scientific research, whose purpose is to study Cuckoo search algorithm. Also, the objective of this study is to adapt the cuckoo algorithm to a generalized permutation flow-shop problem for minimizing the total completion time, so the problem is denoted as follow: Fm | | Cmax. Simulation results are judged by the total completion time and algorithm run time for each instance processed

    A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation

    Get PDF
    [EN] The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many production scheduling problems resemble flowshops and hence it has generated much interest and had a big impact in the field, resulting in literally hundreds of heuristic and metaheuristic methods over the last 60 years. However, most methods proposed for makespan minimisation are not properly compared with existing procedures so currently it is not possible to know which are the most efficient methods for the problem regarding the quality of the solutions obtained and the computational effort required. In this paper, we identify and exhaustively compare the best existing heuristics and metaheuristics so the state-of-the-art regarding approximate procedures for this relevant problem is established. (C) 2016 Elsevier B.V. All rights reserved.The authors are sincerely grateful to the anonymous referees, who provide very valuable comments on the earlier version of the paper. This research has been funded by the Spanish Ministry of Science and Innovation, under projects "ADDRESS" (DPI2013-44461-P/DPI) and "SCHEYARD" (DPI2015-65895-R) co-financed by FEDER funds.Fernandez-Viagas, V.; Ruiz García, R.; Framinan, J. (2017). A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. European Journal of Operational Research. 257(3):707-721. https://doi.org/10.1016/j.ejor.2016.09.055S707721257

    Hybrid flow shop scheduling problems using improved fireworks algorithm for permutation

    Get PDF
    Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy. The permutation flow shop scheduling problem and hybrid flow shop scheduling problems are important production scheduling types, which widely exist in industrial production fields. This study aimed to acquire the best scheduling strategy for making production plans. An improved fireworks algorithm is proposed to minimize the makespan in the proposed strategies. The proposed improved fireworks algorithm is compared with the fireworks algorithm, and the improvement strategies include the following: (1) A nonlinear radius is introduced and the minimum explosion amplitude is checked to avoid the waste of optimal fireworks; (2) The original Gaussian mutation operator is replaced by a hybrid operator that combines Cauchy and Gaussian mutation to improve the search ability; and (3) An elite group selection strategy is adopted to reduce the computing costs. Two instances from the permutation flow shop scheduling problem and hybrid flow shop scheduling problems were used to evaluate the improved fireworks algorithm’s performance, and the computational results demonstrate the improved fireworks algorithm’s superiority

    Permütasyon Akış Tipi Çizelgeleme Probleminin El Bombası Patlatma Metodu ile Çözümü

    Get PDF
    Üretimde kaynakların verimli kullanımı için işlerin en iyi şekilde çizelgelenmesi gerekmektedir. Gerçek hayatta çok sayıda uygulaması bulunan permütasyon akış tipi çizelgeleme problemi (PATÇP) yarım asırdan uzun süredir araştırmacıların ilgisini çekmektedir. El Bombası Patlatma Metodu (EBPM) Ahrari ve arkadaşları tarafından el bombalarının patlamalarından esinlenerek geliştirilmiş evrimsel bir algoritmadır. Bu çalışmada EBPM, permütasyon akış tipi çizelgeleme problemlerinin çözümü için uyarlanmıştır. Daha sonra metodu diğer metasezgisellerden ayıran özellik olan ajan bölgesi yarıçapının metot performansına etkisi araştırılmış ve metodun maksimum tamamlanma zamanı performans ölçütüne göre Taillard tarafından geliştirilmiş olan test problemleri üzerindeki performansları incelenmiştir. Sonuç olarak EBPM’nin makul sürelerde kabul edilebilir sonuçlara ulaşabildiği ve PATÇP’lerin çözümünde kullanılabileceği görülmüştür

    Real-Time Order Acceptance and Scheduling Problems in a Flow Shop Environment Using Hybrid GA-PSO Algorithm

    Get PDF

    Cuckoo Search Algorithm with Hybrid Factor Using Dimensional Distance

    Get PDF

    Evolutionary Computation 2020

    Get PDF
    Intelligent optimization is based on the mechanism of computational intelligence to refine a suitable feature model, design an effective optimization algorithm, and then to obtain an optimal or satisfactory solution to a complex problem. Intelligent algorithms are key tools to ensure global optimization quality, fast optimization efficiency and robust optimization performance. Intelligent optimization algorithms have been studied by many researchers, leading to improvements in the performance of algorithms such as the evolutionary algorithm, whale optimization algorithm, differential evolution algorithm, and particle swarm optimization. Studies in this arena have also resulted in breakthroughs in solving complex problems including the green shop scheduling problem, the severe nonlinear problem in one-dimensional geodesic electromagnetic inversion, error and bug finding problem in software, the 0-1 backpack problem, traveler problem, and logistics distribution center siting problem. The editors are confident that this book can open a new avenue for further improvement and discoveries in the area of intelligent algorithms. The book is a valuable resource for researchers interested in understanding the principles and design of intelligent algorithms

    Comparison of new metaheuristics, for the solution of an integrated jobs-maintenance scheduling problem

    Get PDF
    This paper presents and compares new metaheuristics to solve an integrated jobs-maintenance scheduling problem, on a single machine subjected to aging and failures. The problem, introduced by Zammori et al. (2014), was originally solved using the Modified Harmony Search (MHS) metaheuristic. However, an extensive numerical analysis brought to light some structural limits of the MHS, as the analysis revealed that the MHS is outperformed by the simpler Simulated Annealing by Ishibuchi et al. (1995). Aiming to solve the problem in a more effective way, we integrated the MHS with local minima escaping procedures and we also developed a new Cuckoo Search metaheuristic, based on an innovative Levy Flight. A thorough comparison confirmed the superiority of the newly developed Cuckoo Search, which is capable to find better solutions in a smaller amount of time. This an important result, both for academics and practitioners, since the integrated job-maintenance scheduling problem has a high operational relevance, but it is known to be extremely hard to be solved, especially in a reasonable amount of time. Also, the developed Cuckoo Search has been designed in an extremely flexible way and it can be easily readapted and applied to a wide range of combinatorial problems. (C) 2018 Elsevier Ltd. All rights reserved

    Algorithms and Methods for Designing and Scheduling Smart Manufacturing Systems

    Get PDF
    This book, as a Special Issue, is a collection of some of the latest advancements in designing and scheduling smart manufacturing systems. The smart manufacturing concept is undoubtedly considered a paradigm shift in manufacturing technology. This conception is part of the Industry 4.0 strategy, or equivalent national policies, and brings new challenges and opportunities for the companies that are facing tough global competition. Industry 4.0 should not only be perceived as one of many possible strategies for manufacturing companies, but also as an important practice within organizations. The main focus of Industry 4.0 implementation is to combine production, information technology, and the internet. The presented Special Issue consists of ten research papers presenting the latest works in the field. The papers include various topics, which can be divided into three categories—(i) designing and scheduling manufacturing systems (seven articles), (ii) machining process optimization (two articles), (iii) digital insurance platforms (one article). Most of the mentioned research problems are solved in these articles by using genetic algorithms, the harmony search algorithm, the hybrid bat algorithm, the combined whale optimization algorithm, and other optimization and decision-making methods. The above-mentioned groups of articles are briefly described in this order in this book
    corecore