144 Hits in 4.1 sec

Some heuristic algorithms for total tardiness minimization in a flowshop with blocking

Débora P. Ronconi, Luís R.S. Henriques
2009 Omega : The International Journal of Management Science  
The flowshop scheduling problem with blocking in-process is addressed in this paper.  ...  Heuristic approaches are proposed to minimize the total tardiness criterion. A constructive heuristic that explores specific characteristics of the problem is presented.  ...  As far as we know, few studies deal with the total tardiness criterion in the flowshop environment with blocking.  ... 
doi:10.1016/ fatcat:vdrvacj7ljb7firgqpxyt4etrq

No-Wait Flowshops to Minimize Total Tardiness with Setup Times

Tariq Aldowaisan, Ali Allahverdi
2015 Intelligent Control and Automation  
The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness.  ...  Two heuristics, a simulated annealing (SA) and a genetic algorithm (GA), have been proposed by using the best performing dispatching rule as the initial solution for SA, and the three superior dispatching  ...  ( 2003 ) 2003 New Heuristics for No-Wait Flowshops to Minimize Makespan.  ... 
doi:10.4236/ica.2015.61005 fatcat:ryb7tsiorjgkxn533d4rtie76m

A Survey on Occurrence of Critical Machines in a Manufacturing Environment

R. Pugazhenthi, M. Anthony Xavior
2014 Procedia Engineering  
This article focused on the possibility of critical machine, position of critical machine and the need of a hybrid flowshop in the modern manufacturing environment for the effective management of the critical  ...  This Study was done to analyze the maximum possibilities and effective utilization of critical machines in a flowshop.  ...  Here the genetic algorithm and meta-heuristic approach are used for the flowshop with the parallel machines.  ... 
doi:10.1016/j.proeng.2014.12.230 fatcat:ibircga6lvgexiqeqckfazbaem

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  
All publications are categorized regarding the solution methods, as well as the structure of the hybrid flowshop which helps researcher and practitioner to use/modify proper solution algorithm for solving  ...  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  ...  Generalized tardiness flowshop: In flowshop models, dealing with the tardiness criteria, there is a given due date for completion of the last operation of each job.  ... 
doi:10.1080/00207543.2010.543178 fatcat:ch5qv36nyjedvojvytrmjh6wpu

Flowshop-scheduling problems with makespan criterion: a review

S. Reza Hejazi *, S. Saghafian
2005 International Journal of Production Research  
Moreover, in the first section, a complete literature review of flowshop-related scheduling problems with different assumptions as well as contributions in solving these other aspects is considered.  ...  It mainly considers a flowshop problem with a makespan criterion and it surveys some exact methods (for small size problems), constructive heuristics and developed improving metaheuristic and evolutionary  ...  Yeong-Dae Kim (1993) worked on heuristic for minimizing mean tardiness for flowshop-scheduling in his article and Zhu and Meady (2000) by trying to minimize the sum of earliness/tardiness in multi-machine  ... 
doi:10.1080/0020754050056417 fatcat:gbcqshoqerhnjek2l4uqcmhdr4

Page 835 of The Journal of the Operational Research Society Vol. 55, Issue 8 [page]

2004 The Journal of the Operational Research Society  
Omega tardiness minimization in flowshop scheduling problems. it: 91-95. Comput Opns Res 26: 219-235. Koulamas C (1998). A new constructive heuristic for the flowshop scheduling problem.  ...  Job shop scheduling with genetic algorithms. In: which features of the genetic algorithms will have the most Grenfenstette JJ (ed).  ... 

Minimizing total tardiness in no-wait flowshops

Tariq Aldowaisan, Ali Allahverdi
2012 Foundations of Computing and Decision Sciences  
We address the m-machine no-wait flowshop scheduling problem; where the objective is to minimize total tardiness. To the best of our knowledge, the considered problem has not been addressed so far.  ...  Initially, we consider a number of dispatching rules commonly used for the considered objective in other scheduling environments.  ...  Several parameters affect the performance of genetic algorithm when implemented for optimizing the total tardiness of the no-wait flowshop problem.  ... 
doi:10.2478/v10209-011-0009-6 fatcat:xbe2utlopzechovphtlinunicy

Guidelines for developing effective Estimation of Distribution Algorithms in solving single machine scheduling problems

Shih-Hsin Chen, Min-Chih Chen, Pei-Chann Chang, Qingfu Zhang, Yuh-Min Chen
2010 Expert systems with applications  
The proposed algorithm solved the single machine scheduling problems with earliness/tardiness cost in a just-in-time scheduling environment.  ...  Because NEH is a well-known heuristic in solving permutation flowshop problems with the objective of makespan, this heuristic generates a good initial solution for EDAs.  ...  They are the single machine scheduling problems with minimization of earliness/tardiness cost and the permutation flowshop with the objective of makespan.  ... 
doi:10.1016/j.eswa.2010.02.073 fatcat:k2hx7pbvefcahhbmu4z3s4f6m4

A Genetic Algorithm for a Two-Machine Flowshop with a Limited Waiting Time Constraint and Sequence-Dependent Setup Times

Ju-Yong Lee, Dr. Dilbag Singh
2020 Mathematical Problems in Engineering  
The objective of this scheduling problem is to minimize the total tardiness.  ...  This study considers a two-machine flowshop with a limited waiting time constraint between the two machines and sequence-dependent setup times on the second machine.  ...  On the other hand, for a flowshop problem with LWT for the objective of minimizing total tardiness, a heuristic algorithm and a Lagrangian relaxation-based lower bound strategy [26] have been developed  ... 
doi:10.1155/2020/8833645 fatcat:6xtjyn46tjemtms2oviujcwl74

Multi-criteria blocking flow shop scheduling problems: Formulation and performance analysis

G. Lebbar, I. El Abbassi, A. Jabri, A. El Barkany, M. Darcherif
2018 Advances in Production Engineering & Management  
This paper deals with multi machines permutation flow shop scheduling with limited buffers capacity and different release dates of jobs, where the performance is measured by the minimization of the weighted  ...  Thereafter, using CPLEX software, we generate a set of tests in an endeavor to examine formulation for dissimilar size problems in terms of optimality solution and computational CPU time complexity.  ...  Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness, In: Ríos-Mercado, R., Ríos-Solís, Y.  ... 
doi:10.14743/apem2018.2.279 fatcat:oroltsndeza35lasr6qdhl3vyy

A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times

Aref Maleki-Darounkolaei, Mahmoud Modiri, Reza Tavakkoli-Moghaddam, Iman Seyyedi
2012 Journal of Industrial Engineering International  
Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten  ...  ., [16] introduced a hybrid genetic algorithm (GA) for flowshop scheduling with limited buffers with the objective to minimize the total completion time.  ...  ., [29] proposed a HDDE algorithm for solving a flowshop scheduling with blocking to minimize the makespan.  ... 
doi:10.1186/2251-712x-8-26 fatcat:l2tgh4gjnvfgrpcc2zct4duu2u

Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems

Pei-Chann Chang, Shih-Hsin Chen, Chin-Yuan Fan, Chien-Lung Chan
2008 Applied Mathematics and Computation  
The artificial chromosome generating mechanism is embedded in simple genetic algorithm (SGA) and the non-dominated sorting genetic algorithm (NSGA-II) to solve single-objective and multiobjective flowshop-scheduling  ...  Recently, a wealthy of research works has been dedicated to the design of effective and efficient genetic algorithms in dealing with multi-objective scheduling problems.  ...  The proposed algorithm will be tested on flowshop scheduling problem in minimizing makespan for single-objective problems and in minimizing makespan and maximum tardiness for the multiobjective problems  ... 
doi:10.1016/j.amc.2008.05.027 fatcat:xjq26us7qbbcbfx2cf7vqqxc64

A hybrid genetic algorithm for a complex cost function for flowshop scheduling problem

Debraj Bhowmick, P. Maniyan, Anjali Saxena, Yves Ducq
2011 International Journal of Electronic Transport  
In this paper, we consider a performance criterion for the flowshop scheduling problem that aims to minimise a complex cost function, i.e., the sum of weighted tardiness and weighted flow-time costs.  ...  A heuristic and hybrid genetic algorithms are proposed and experimental results are provided.  ...  ., the sum of weighted tardiness and weighted flow time costs. In this paper, we present a heuristic and hybrid genetic algorithms for the complex cost function.  ... 
doi:10.1504/ijet.2011.043116 fatcat:5p65ldxtejby7d66j7jj4nfhbi

Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance

Tuane Tonani Yamada, Marcelo Seido Nagano, Hugo Hissashi Miyata
2021 International Journal of Industrial Engineering Computations  
Therefore, in this study, we propose constructive methods to minimize a total tardiness criterion, considering preventative maintenance constraints to reflect the reality of industrial practice, focusing  ...  on a no-wait flowshop environment in which jobs are successively processed without operational interruptions.  ...  HENN algorithm HENLL proposed algorithm The next proposed heuristic was based on the metaheuristic developed by Ribas et al. (2013) , who studied a blocking flowshop scheduling problem with total tardiness  ... 
doi:10.5267/j.ijiec.2021.5.002 fatcat:lou7ls2ev5fvdf66aw7hgrzkeq

Lot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors

2015 International Journal of Engineering  
In order to verify the effectiveness of proposed algorithms, Relative percentage Deviation along with statistical analysis is presented.The computational results show that VNSSA outperforms VNSTS in most  ...  These algorithms are based on the Variable Neighborhood Search (VNS), which is proved as an effective method for combinatorial optimization problems.  ...  Ventura and Yoon [16] investigated a n-job m-machine flowshop scheduling problem and consider equal sublots and limited capacity buffers with blocking and proposed a new Genetic Algorithm to solve the  ... 
doi:10.5829/idosi.ije.2015.28.07a.09 fatcat:j57w4pneqfgszmk5gzwjquhhyu
« Previous Showing results 1 — 15 out of 144 results