Filters








36 Hits in 11.2 sec

Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems

Laxmi Bewoor, V. Chandra Prakash, Sagar Sapkal
2017 Algorithms  
This paper proposes an effective hybrid Particle Swarm Optimization (PSO) metaheuristic algorithm for solving no-wait flow shop scheduling problems with the objective of minimizing the total flow time  ...  The scheduling of a no-wait flow shop requires finding an appropriate sequence of jobs for scheduling, which in turn reduces total processing time.  ...  They explored the applicability of this algorithm to manufacturing scheduling problem in general and no wait flow shop in particular. Accordingly, Laxmi A.  ... 
doi:10.3390/a10040121 fatcat:f76dx6krczcyhcmra3snxvuanq

Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: A systematic literature review

Harpreet Singh, Jaspreet Singh Oberoi, Doordarshi Singh
2020 Reserche operationelle  
Flow shop scheduling is a type of scheduling where sequence follows for each job on a set of machines for processing.  ...  The flexible flow shop scheduling problems with no-wait have mainly addressed for flow optimization on the shop floor in manufacturing, processing, and allied industries.  ...  The second algorithm is an optimization of migrating birds, improved by a revised neighborhood search.  ... 
doi:10.1051/ro/2020055 fatcat:t3g52lg2jzghfcljyig6ruu25a

An improved discrete migrating birds optimization algorithm for the no-wait flow shop scheduling problem

Su Jun Zhang, Xing Sheng Gu, Fu Na Zhou
2020 IEEE Access  
An improved discrete migrating birds optimization (IDMBO) algorithm is presented in this work to solve the no-wait flow shop scheduling problem (NWFSSP) with makespan criterion.  ...  INDEX TERMS Improved discrete migrating birds optimization algorithm, no-wait flow shop scheduling problem, hybrid multi-neighborhood strategy, population reset mechanism.  ...  CONCLUSION In the work, an improved discrete migrating birds optimization (IDMBO) algorithm is presented to solve NWFSSP with makespan criterion.  ... 
doi:10.1109/access.2020.2997379 fatcat:lqlmpomxurgf3d5dc5dcbzhcua

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

Massimo Bertolini, Davide Mezzogori, Francesco Zammori
2019 Expert systems with applications  
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 Lévy Flight  ...  The problem, introduced by Zammori et al. ( 2014 ), was originally solved using the Modified Harmony Search (MHS) metaheuristic.  ...  (1| Due Dates, Sequence Dependent Set-Up Times, Planned Maintenance| ETP) scheduling problem.  ... 
doi:10.1016/j.eswa.2018.12.034 fatcat:srjs27nnmbcwlfulsc3ikehrqy

SIRA BAĞIMLI HAZIRLIK SÜRELİ MELEZ ESNEK AKIŞ TİPİ ATÖLYELERDE ÇİZELGELEME PROBLEMİ İÇİN SINIRLI SAYIMLAMA VE MAKİNE GRUPLAMAYA DAYALI BİR YAKLAŞIM

Müjgan SAĞIR ÖZDEMİR, Hacer OKUL
2020 Endüstri Mühendisliği  
This paper presents a 0-1 Mixed Integer Programming Model and a heuristic approach based on restricted enumeration and machine grouping for solving k-stage Hybrid Flexible Flow Shop Problems with Sequence-Dependent  ...  The heuristic algorithm, based on sub-flow shops via forming machine groups in different clusters, is suggested to give good solutions for large-size problems and can to reach the optimal or near-optimal  ...  Sioud and Gagné (2018) have presented an enhanced "Migrating Bird Optimization (MBO)" algorithm and a new heuristic for solving a scheduling problem.  ... 
doi:10.46465/endustrimuhendisligi.706010 fatcat:3gq6abx6i5gjphrluxa4tg73im

Survey of Metaheuristic Algorithms for Combinatorial Optimization

Malti Baghel, Shikha Agrawal, Sanjay Silakari
2012 International Journal of Computer Applications  
This paper aims to present a brief survey of different metaheuristic algorithms for solving the combinatorial optimization problems.  ...  Population based methods deal with a set of solutions. These include genetic algorithm, ant colony optimization and particle swarm optimization.  ...  Barnes et al. (1993) proposes static TC for solving the multiple mechanic weighted flow time problem.  ... 
doi:10.5120/9391-3813 fatcat:7ur2f64xvvb6jc4ojsd5jujfeq

Comparisons of bi-objective genetic algorithms for hybrid flowshop scheduling with sequence-dependent setup times

S.M. Mousavi, M. Zandieh, M. Amiri
2012 International Journal of Production Research  
A B S T R A C T Multi-criteria sequence dependent setup times scheduling problems exist almost everywhere in real modern manufacturing world environments.  ...  Among them, Sequence Dependent Setup Times-Multi-Objective Hybrid Flowshop Scheduling Problem (SDST-MOHFSP) has been an intensifying attention of researchers and practitioners in the last three decades  ...  Li and Li [130] focused on a SDST-MOHFSP with both sequence dependent setup times and sequence independent setup times to minimize makespan and total flow time.  ... 
doi:10.1080/00207543.2010.543178 fatcat:ch5qv36nyjedvojvytrmjh6wpu

Distributed Flow Shop Scheduling with Sequence-Dependent Setup Times Using an Improved Iterated Greedy Algorithm

Xue Han, Yuyan Han, Qingda Chen, Junqing Li, Hongyan Sang, Yiping Liu, Quanke Pan, Yusuke Nojima
2021 Complex System Modeling and Simulation  
To meet the multi-cooperation production demand of enterprises, the distributed permutation flow shop scheduling problem (DPFSP) has become the frontier research in the field of manufacturing systems.  ...  In this paper, we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequencedependent setup times.  ...  Thanks for the support of Shandong province colleges and universities youth innovation talent introduction and education program.  ... 
doi:10.23919/csms.2021.0018 fatcat:uxqwcolvkngrtgt6eu25zyk2sa

Modeling and solution methods for hybrid flow shop scheduling problem with job rejection

Mohamadreza Dabiri, Mehdi Yazdani, Bahman Naderi, Hassan Haleh
2021 Operational Research  
Additionally, this paper studies the efficacy of job rejection noting the scheduling for a real-world hybrid flow shop in the tile industry production system.  ...  This paper addresses the hybrid flow shop scheduling problem by considering job rejection to minimize the sum of the total tardiness cost of the scheduled jobs and total cost of the rejected jobs as a  ...  Zhang et al. (2017) implemented an effective modified migrating birds optimization (EMBO) for HFS problem with lot streaming to minimize the total flow time.  ... 
doi:10.1007/s12351-021-00629-2 fatcat:33sxe5n7znhtxls3fnttt7dg5a

Just-in-time scheduling in identical parallel machine sequence-dependent group scheduling problem

Alireza Goli, Taha Keshavarz
2021 Journal of Industrial and Management Optimization  
<p style='text-indent:20px;'>In this research, a parallel machine sequence-dependent group scheduling problem with the goal of minimizing total weighted earliness and tardiness is investigated.  ...  Since the problem is shown to be NP-hard, this research focuses on proposing meta-heuristic algorithms for finding near-optimal solutions.  ...  [14] considered the flow shop sequence-dependent group scheduling problem with minimization of total weighted earliness and tardiness as the objective function.  ... 
doi:10.3934/jimo.2021124 fatcat:x2lh22225feq7hwmkqcn2aynqq

Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems

Pedro Alfaro-Fernández, Rubén Ruiz, Federico Pagnozzi, Thomas Stützle
2019 European Journal of Operational Research  
AAD is capable of composing algorithms from components with minimal human intervention. We test the proposed AAD for three different optimization objectives in the hybrid flowshop.  ...  The traditional design process of metaheuristics is mainly manual, often metaphor-based, biased by previous experience and prone to producing overly tailored methods that only work well on the tested problems  ...  Acknowledgments Pedro Alfaro-Fernández and Rubén Ruiz are partially supported by the Spanish Ministry of Science, Innovation, and Universities, under the project "OPTEP-Port Terminal Operations Optimization  ... 
doi:10.1016/j.ejor.2019.10.004 fatcat:g3pkdeqh5jgandc4idsprnijdm

Energy-efficient integration optimization of production scheduling and ladle dispatching in steelmaking plants

Dayong Han, Qiuhua Tang, Zikai Zhang, Jun Cao
2020 IEEE Access  
ACKNOWLEDGE This work is supported by the National Natural Science Foundation of China (No. 51875421).  ...  Section V presents an enhanced migrating birds optimization algorithm with several improvements to tackle this problem.  ...  Among the metaheuristics, migrating birds optimization algorithm (MBO), as a new meta-heuristic algorithm inspired by the V-shaped flight formation of migrating birds, has been proved to be effective on  ... 
doi:10.1109/access.2020.3027018 fatcat:b6xwne4lrrazto4h3kv4ayp7x4

Unified Multi-Objective Genetic Algorithm for Energy Efficient Job Shop Scheduling

Hongjing Wei, Shaobo Li, Huafeng Quan, Dacheng Liu, Shu Rao, Chuanjiang Li, Jianjun Hu
2021 IEEE Access  
Three sets of numerical experiments have been carried out on the extended Taillard benchmark to verify this three-objective model's effectiveness and the multi-objective optimization algorithm.  ...  The multi-objective optimization algorithm can generate a Pareto set of solutions so that production managers can flexibly select a schedule from these nondominated schedules based on their priorities.  ...  algorithm (ML-MOMA) for the discrete permutation flow shop scheduling problem [40] , Zhang et al. introduced particle swarm optimization (PSO) and neural network (NN) to solve the job-shop scheduling  ... 
doi:10.1109/access.2021.3070981 fatcat:54t4jzcs3jhfjfmli3noarz4da

Metaheuristic optimization frameworks: a survey and benchmarking

José Antonio Parejo, Antonio Ruiz-Cortés, Sebastián Lozano, Pablo Fernandez
2011 Soft Computing - A Fusion of Foundations, Methodologies and Applications  
Out of 33 frameworks ten have been selected from the literature using well-defined filtering criteria, and the results of the comparison are analyzed with the aim of identifying improvement areas and gaps  ...  This paper performs an unprecedented comparative study of Metaheuristic optimization frameworks.  ...  This work has been partially funded by the European Commission (FEDER) and Spanish Government under CICYT project SETI (TIN2009-07366) and the Andalusian Government projects ISABEL (TIC-2533) and THEOS  ... 
doi:10.1007/s00500-011-0754-8 fatcat:tetgfc7qz5h3xkeabsxv3gwgoe

Revisiting dynamic constraint satisfaction for model-based planning

Jeremy Frank
2016 Knowledge engineering review (Print)  
We extend the notion of transformations to include constrained optimization problems.  ...  In this paper, we identify some limitations with the previously developed theories of dynamic constraint satisfaction.  ...  Acknowledgements We acknowledge the contributions Paul Morris, Minh Do and Tristan Smith made to early drafts of this paper. References Acknowledgements  ... 
doi:10.1017/s0269888916000242 fatcat:nt6cscltjbbpndpji2hs7vdsvy
« Previous Showing results 1 — 15 out of 36 results