Filters








1,903 Hits in 7.6 sec

Estimation of Heuristics for adaptation Flow Shops and Flow Shops with sequence Dependent Setup Times (SDST)

Brahma Datta Shukla
2018 International Journal for Research in Applied Science and Engineering Technology  
This paper presents an estimation of both the transformation flow shop and the flow shop with Sequence Dependent Setup Times (known as SDST flow shop).  ...  Numerous researches have been accomplished on the transformation version of the flow shop scheduling problem and wide range of heuristics has been developed.  ...  Two new hybrid genetic algorithms with minimization of makespan as objective has also been proposed by Ruiz et al. [17] for PFSP.  ... 
doi:10.22214/ijraset.2018.1411 fatcat:uo35c2g6afgc5e6zariezseqki

Assigning dispatching rules using a genetic algorithm to solve a hybrid flow shop scheduling problem

Benjamin Rolf, Tobias Reggelin, Abdulrahman Nahhas, Sebastian Lang, Marcel Müller
2020 Procedia Manufacturing  
The paper shows how assigning different predefined dispatching rules for a predefined number of times at any points in time using a genetic algorithm can solve a hybrid flow shop scheduling problem with  ...  Abstract The paper shows how assigning different predefined dispatching rules for a predefined number of times at any points in time using a genetic algorithm can solve a hybrid flow shop scheduling problem  ...  Experiments with varying numbers of switching points and the impact on solution quality and the required computational time are another direction to access the scheduling problem.  ... 
doi:10.1016/j.promfg.2020.02.051 fatcat:5wtwl66swfhmtnoeewgso3xtkm

A hybrid genetic algorithm for the hybrid flow shop scheduling problem with machine blocking and sequence-dependent setup times

Ingrid Simões Ferreira Maciel, Bruno de Athayde Prata, Marcelo Seido Nagano, Levi Ribeiro de Abreu
2022 Journal of Project Management  
Prior studies are neglecting identical machines, explicit and sequence-dependent setup times, and machine blocking. We propose a hybrid genetic algorithm to solve the problem.  ...  Our proposal incorporates two metaheuristics in this process: a genetic algorithm to generate sequences (the flow shop subproblem) and a GRASP to allocate the jobs in the machines (the parallel machines  ...  Take into consideration the hybrid flow shop scheduling problems with sequence-dependent setup times to minimize the makespan, several approaches have been reported for solving the problem: Zandieh, Ghomi  ... 
doi:10.5267/j.jpm.2022.5.002 fatcat:m4tqqfsrnjfypgwtpsip65z6uu

A hybrid genetic local and global search algorithm for solving no-wait flow shop problem with bi criteria

Kenan Keskin, Orhan Engin
2021 SN Applied Sciences  
AbstractThis paper addresses the m-machine no-wait Flow Shop Scheduling with Setup Times (NW-FSSWST). Two performance measures: total flow time and makespan are considered.  ...  A Hybrid Genetic Local and Global Search Algorithm (HGLGSA) is proposed to solve the NW-FSSWST for two performance criteria.  ...  with setup times. • The proposed hybrid genetic local and global search algorithm is first used to solve the no-wait flow shop scheduling with setup times problems for two criteria. • A full factorial  ... 
doi:10.1007/s42452-021-04615-3 fatcat:nvn62vpgzvaf7ivbemtc52cx7i

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

Mohammad Mirabi, S. M. T. Fatemi Ghomi, F. Jolai
2014 Journal of Industrial Engineering International  
They developed a genetic algorithm for the case of hybrid flow-shop scheduling problem that the processing time of each job for each machine at each stage is the source of uncertainty.  ...  Tseng and Lin (2010) proposed a hybrid genetic algorithm to solve the no-wait flow-shop scheduling problem with the make-span objective.  ... 
doi:10.1007/s40092-014-0057-7 fatcat:zyl2kgdzbjaprit7eso7gnb3n4

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

M. B. Fakhrzad
2013 International Journal of Engineering  
This paper presents a new multi-objective job shop scheduling with sequence-dependent setup times.  ...  Scince a job shop scheduling problem has been proved to be NP-hard in a strong, traditional approaches cannot reach to an optimal solution in a reasonable time.  ...  PROBLEM DESCRIPTION This section presents a MILP model for the job shop scheduling with setup times.  ... 
doi:10.5829/idosi.ije.2013.26.02b.11 fatcat:azlm2xhzw5cmlggz3ajbnajqoq

Optimization Of Flexible Job Shop Scheduling Problem With Sequence Dependent Setup Times Using Genetic Algorithm Approach

Sanjay Kumar Parjapati, Ajai Jain
2015 Zenodo  
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.  ...  Results indicate that optimal makespan can be achieved with more than one sequence of jobs in a production order.  ...  ADOPTED METHODOLOGY In order to find the optimal schedule for a flexible job shop with sequence dependent setup times, a genetic algorithm based methodology is adopted in the present work.  ... 
doi:10.5281/zenodo.1098021 fatcat:ywkawtfevvgz7j2sr5d6t2qoze

SOLVING THE HYBRID FLOW SHOP SCHEDULING PROBLEM USING HEURISTIC ALGORITHMS

Fatma Selen MADENOĞLU
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.  ...  The result of NEH heuristic with SPTF rule outperformed other heuristics for the proposed HFS problems.  ...  CONCLUSIONS In this paper, a new variant for the hybrid flow shop scheduling considering missing operations, sequence-dependent setup times and transportation times is discussed.  ... 
doi:10.15295/bmij.v7i3.1226 fatcat:lvmyb47vnfcrhjar2xzfdpzwdi

An efficient genetic algorithm for a hybrid flow shop scheduling problem with time lags and sequence-dependent setup time

Mohammad Farahmand-Mehr, Parviz Fattahi, Mohammad Kazemi, Hassan Zarei, Ali Piri
2014 Manufacturing Review  
In this paper, a hybrid flow shop scheduling problem with a new approach considering time lags and sequence-dependent setup time in realistic situations is presented.  ...  Computational results indicate that the designed GA can produce near optimal solutions in a short computational time for different size problems.  ...  In this paper, a hybrid flow shop scheduling problem with a new approach considering time lags and sequence-dependent setup time in realistic situations is presented.  ... 
doi:10.1051/mfreview/2014020 fatcat:ovs26ckeezcz3idoqd6utfsofu

A dual encoding-based meta-heuristic algorithm for solving a constrained hybrid flow shop scheduling problem

Antonio Costa, Fulvio Antonio Cappadonna, Sergio Fichera
2013 Computers & industrial engineering  
In this paper the scheduling problem of a hybrid flow shop with m stages, inspired to a truly observed micro-electronics manufacturing environment, has been investigated.  ...  In the first phase the proposed ME algorithm evolves similarly to a genetic algorithm equipped with a regular permutation encoding.  ...  Ruiz and Maroto (2006) studied the makespan minimization of a HFS with sequence dependant setup times and machine eligibility scheduling problem through a genetic algorithm.  ... 
doi:10.1016/j.cie.2013.01.004 fatcat:dnwmzxg3qfhwhlramvlx5k7g6m

Meta-heuristics for manufacturing scheduling and logistics problems

Ching-Jong Liao, Mitsuo Gen, Manoj Kumar Tiwari, Pei-Chann Chang
2013 International Journal of Production Economics  
(2013) proposed a genetic algorithm based heuristic for two machine no-wait flow-shop scheduling problems with class setup times that minimizes maximum lateness.  ...  Zhang et al. (2013) proposed a hybrid artificial bee colony (ABC) algorithm for the job shop scheduling problem.  ... 
doi:10.1016/j.ijpe.2012.09.004 fatcat:ri2ogbsa6rbqpi2s3vnkenhhz4

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  
This paper gives a comprehensive guide for the reader with respect to future research work on the FFS scheduling problem.  ...  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 Hybrid Genetic Algorithm For The Sequence Dependent Flow-Shop Scheduling Problem

Mohammad Mirabi
2011 Zenodo  
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of jobs that visit a set of machines in the same order.  ...  To meet the requirements on time and to minimize the make-span performance of large permutation flow-shop scheduling problems in which there are sequence dependent setup times on each machine, this paper  ...  Finally Sheibani [26] described a polynomial-time heuristic (PH) for the permutation flow-shop scheduling problem with the makespan criterion.  ... 
doi:10.5281/zenodo.1332577 fatcat:7jyh3vk3xja6lmq2j3vq2472tq

A Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching

Rashed Sahraeian
2014 International Journal of Industrial Engineering and Production Research  
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied.  ...  As the problem is NP-hard, a genetic algorithm is developed to give near optimal solutions.  ...  Ruiz and Maroto [23] considered a genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility.  ... 
doaj:7773d52363b6410a8b271c15b83f4371 fatcat:cogqvykpn5feridrwyndsxohua

A hybrid algorithm for flexible job-shop scheduling problem with setup times

Ameni Azzouz, Meriem Ennigrou, Lamjed Ben Said
2017 International Journal of Production Management and Engineering  
For that, we propose a hybrid algorithm based on genetic algorithm (GA) and variable neighbourhood search (VNS) to solve this problem.  ...  This paper addresses the flexible job-shop scheduling problem with sequence-dependent setup times to minimize two kinds of objectives function: makespan and bi-criteria objective function.  ...  Acknowledgements This he authors would like to say thanks to Miguel A. Gonzalez for providing us with the SDST-FJSP instances.  ... 
doi:10.4995/ijpme.2017.6618 fatcat:e6payby5wbcmzjrmhqcfyoismu
« Previous Showing results 1 — 15 out of 1,903 results