4,036 Hits in 7.3 sec

Parallelism and Hybridization in Differential Evolution to solve the Flexible Job Shop Scheduling Problem

Carolina Salto, Franco Morero, Carlos Bermúdez
2020 Journal of Computer Science and Technology  
Flexible Job Shop Scheduling Problem (FJSP) is one of the most challenging combinatorial optimization problems, with practical applicability in a real production environment.  ...  In this work, we propose a simple Differential Evolution (DE) algorithm to tackle this problem.  ...  Authors' contribution All authors conceived the idea, wrote the program, conducted the experiments, analyzed the results, and finally, wrote and revised the manuscript.  ... 
doi:10.24215/16666038.20.e04 fatcat:rtn2sswbvfhalc2nkec3drsace

Thematic issue on "advanced intelligent scheduling algorithms for smart manufacturing systems"

Ling Wang, Guohua Wu, Liang Gao
2019 Memetic Computing  
combining differential evolution and simulated annealing to minimize the earliness/tardiness and the total cost for the distributed assembly flexible job shop scheduling problem effectively and efficiently  ...  The first paper titled "An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem" by Wu et al. proposes a multi-objective memetic algorithm by  ...  Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.  ... 
doi:10.1007/s12293-019-00297-y fatcat:akjwpjwdije7zhgqlyn6gkdioy

Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time

Seyedeh Sarah Zabihzadeh, Javad Rezaeian
2016 Applied Soft Computing  
In this research, flexible flow shop scheduling with unrelated parallel machines at each stage are considered.  ...  The main contribution of this study is to present the mixed integer linear programming model for the problem which considers release times for parts in scheduling area, loading and unloading times of parts  ...  harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion.Wang et al. [15] proposed a novel hybrid discrete differential evolution  ... 
doi:10.1016/j.asoc.2015.11.008 fatcat:oyevf33slzfohabf4s2djg4jhm

Improved Differential Evolution Algorithm for Flexible Job Shop Scheduling Problems

Prasert Sriboonchandr, Nuchsara Kriengkorakot, Preecha Kriengkorakot
2019 Mathematical and Computational Applications  
This research project aims to study and develop the differential evolution (DE) for use in solving the flexible job shop scheduling problem (FJSP).  ...  The results further showed that basic DE and improved DE with jump search are effective methods compared to the other meta-heuristic methods. Hence, they can be used to solve the FJSP.  ...  Acknowledgments: We would like to thank the Industrial Engineering Department, Faculty of Engineering, Ubon Ratchathani University for funding this research.  ... 
doi:10.3390/mca24030080 fatcat:ezpoulhxrnhipizyu6mkeok6aq

A review of scheduling problem and resolution methods in flexible flow shop

Tian-Soon Lee, Ying-Tai Loong
2019 International Journal of Industrial Engineering Computations  
In addition, the resolution approaches that have been used to solve FFS scheduling problems are discussed.  ...  The Flexible flow shop (FFS) is defined as a multi-stage flow shops with multiple parallel machines.  ...  Acknowledgment The authors would like to thank the reviewers for their constructive comments and the Ministry of Higher  ... 
doi:10.5267/j.ijiec.2018.4.001 fatcat:kiq2jjjsmzgtpoaudrq4qc7ndi

A Bayesian Optimization-based Evolutionary Algorithm for Flexible Job Shop Scheduling

Lu Sun, Lin Lin, Yan Wang, Mitsuo Gen, Hiroshi Kawakami
2015 Procedia Computer Science  
Flexible Job-shop Scheduling Problem (fJSP) is a typical and important scheduling problem in Flexible Manufacturing System (FMS).  ...  The fJSP is an extended version of Job-shop Scheduling (JSP) that is NP hard problem.  ...  In this paper, we introduce a fJSP (flexible Job-shop Scheduling Problem) model to simulate the automatic scheduling for a flexible manufacturing model.  ... 
doi:10.1016/j.procs.2015.09.207 fatcat:qmltqkidqndmtatp334og6yiii

A Hybrid Firefly Algorithm Approach for Job Shop Scheduling Problem

Gayathri Devi K
2021 International Journal for Research in Applied Science and Engineering Technology  
Abstract: Job shop scheduling has always been one of the most sought out research problems in Combinatorial optimization. Job Shop Scheduling problems (JSSP) are categorized under NP hard problems.  ...  In recent years the meta heuristic algorithms have been proved effective to solve hardcore NP problem.  ...  in flexible job shop scheduling problem.  ... 
doi:10.22214/ijraset.2021.39536 fatcat:vpxscj5vp5eldfstysw7hh376i


Marcia De Fatima Morais, Thays Josyane Perassoli Boiko, Leandro Dos Santos Coelho, Rony Peterson Da Rocha, Paulo Roberto PAraíso
2014 Independent Journal of Management & Production  
The goal of the study is to review and analyze the methods in order to solve the Hybrid Flow Shop production scheduling problem with multicriteria functions in the literature.  ...  This research focuses on the Hybrid Flow Shop production scheduling problem, which is one of the most difficult problems to solve.  ...  problems with uniformed and/or dedicated machines in parallel; ii) develop optimum methods to solve multicriteria HFS scheduling problems; iii) develop metaheuristics to solve multicriteria HFS scheduling  ... 
doi:10.14807/ijmp.v5i4.242 fatcat:hpnypjad65dylcdaoat72my4ju


2019 Business And Management Studies An International Journal  
A variant of the hybrid flow shop (HFS) problem considering missing operations, transportation times and sequence-dependent setup times is investigated.  ...  In order to depict the effect of the factors: number of jobs, number of machines, number of production stages, level of missing operations on the result, the additiol experimentes are carried out.  ...  Wang et al. (2010) presented a novel hybrid discrete differential evolution algorithm to solve the blocking flow shop scheduling problem under minimization objective.  ... 
doi:10.15295/bmij.v7i3.1226 fatcat:lvmyb47vnfcrhjar2xzfdpzwdi

Hybrid Discrete Differential Evolution Algorithm for Lot Splitting with Capacity Constraints in Flexible Job Scheduling

Xinli Xu, Li Li, Lixia Fan, Jing Zhang, Xuhua Yang, Wanliang Wang
2013 Mathematical Problems in Engineering  
A two-level batch chromosome coding scheme is proposed to solve the lot splitting problem with equipment capacity constraints in flexible job shop scheduling, which includes a lot splitting chromosome  ...  To balance global search and local exploration of the differential evolution algorithm, a hybrid discrete differential evolution algorithm (HDDE) is presented, in which the local strategy with dynamic  ...  ), and the Open Fund Project of Zhejiang University of Technology (20120814).  ... 
doi:10.1155/2013/986218 fatcat:765tmb7qqfa7jctwdgzirh4kfi

A Hybrid Evolutionary Algorithm for Solving Flexible Job Shop Scheduling Problem

Mahmoud Mahmoud, Mohamed Ali Othman, Ramadan Zean El-Deen, Abd Al-azeem Abd Al-azeem
2009 IJCI. International Journal of Computers and Information  
A hybrid algorithm is introduced for solving flexible job shop scheduling problem. The proposed algorithm consists of three sequential stages.  ...  This paper presents an Evolutionary Algorithm (EA) to solve the flexible job shop scheduling problem, especially minimizing the makespan.  ...  Implementation results show that the proposed hybrid evolution algorithm is suitable for solving the flexible job shop scheduling problem, confirming the effectiveness of the proposed approach and its  ... 
doi:10.21608/ijci.2009.33934 fatcat:sb4743hfjbbgnax476w3vpaoeq

Review of job shop scheduling research and its new perspectives under Industry 4.0

Jian Zhang, Guofu Ding, Yisheng Zou, Shengfeng Qin, Jianlin Fu
2017 Journal of Intelligent Manufacturing  
future new JSP scheduling models and constructing a framework on solving the JSP problem under Industry 4.0.  ...  Traditional job shop scheduling is concentrated on centralized scheduling or semi-distributed scheduling.  ...  into differential evolution algorithm to solve FJSP.  ... 
doi:10.1007/s10845-017-1350-2 fatcat:wsvrdighqfg4de3gamrqs46y2u

A Hybrid Algorithm using Grey Wolf and Chicken Swarm for Flexible Job Shop Scheduling

2019 International journal of recent technology and engineering  
The Job Shop Scheduling Problem (JSSP) is one of the major inconvenience models because it is the hardest combinatorial change in nature.  ...  So far number of algorithms developed to solve JSSP and still there is scope to develop an efficient algorithm.  ...  It consists of single objective and enhanced the method to solve in flexible job shop scheduling problems.  ... 
doi:10.35940/ijrte.d1055.1284s219 fatcat:62saexfs7zhyronoqdufmlyesi

A Co-cooperative Evolutionary Algorithm for Flexible Scheduling Problem under Uncertainty

Yan Wang, Lin Lin, Mitsuo Gen, Lu Sun, Hiroshi Kawakami
2015 Procedia Computer Science  
Due to reduce the constraints of the machine, it becomes higher flexible. But it has high complexity existing in the actual production system and making its complexity is higher.  ...  In this paper, we propose hybrid evolutionary algorithm based on the particle swarm algorithm combining a set-based grouping and parameter adaptive adjustment mechanism.  ...  So, stochastic flexible job shop scheduling (S-fJSP) model is closer to the modelling of scheduling problem in actual production systems.  ... 
doi:10.1016/j.procs.2015.09.205 fatcat:aoxbg4cgsjdn3a5uhx355ndgdq

Genetic Algorithms for Solving Scheduling Problems in Manufacturing Systems

Anna Ławrynowicz
2011 Foundations of Management  
When the manufacturing system is not too large, the traditional methods for solving scheduling problem proposed in the literature are able to obtain the optimal solution within reasonable time.  ...  In addition, the author proposes a new approach to the distributed scheduling in industrial clusters which uses a modified genetic algorithm.  ...  Flexible job shop scheduling problem Genetic algorithms are also used as an optimization tool for solving the flexible job-shop scheduling problem (FJSP).  ... 
doi:10.2478/v10238-012-0039-2 fatcat:s47tk2aqtved3l4hoau5wkq6hu
« Previous Showing results 1 — 15 out of 4,036 results