Filters








21 Hits in 8.2 sec

A Discrete Particle Swarm Optimization Algorithm for the Permutation Flowshop Sequencing Problem with Makespan Criterion [chapter]

Quan-Ke Pan, M. Fatih Tasgetiren, Yun-Chia Liang
2007 Research and Development in Intelligent Systems XXIII  
In this paper, a discrete particle swarm optimization (DPSO) algorithm is presented to solve the permutation flowshop sequencing problem with makespan criterion.  ...  In addition, the DPSO algorithm is hybridized with a simple local search algorithm based on an insert neighborhood to further improve the solution quality.  ...  the random permutation to generate a final permutation of the particle so as to be included in the initial swarm population. 2.  ... 
doi:10.1007/978-1-84628-663-6_2 dblp:conf/sgai/PanTL06 fatcat:77yuwndqfjbjbficjq25s75oda

A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times

Davide Anghinolfi, Massimo Paolucci
2009 European Journal of Operational Research  
In this paper we present a new Discrete Particle Swarm Optimization (DPSO) approach to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup  ...  Differently from previous approaches the proposed DPSO uses a discrete model both for particle position and velocity and a coherent sequence metric.  ...  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 2007; 177; 1930-1947.  ... 
doi:10.1016/j.ejor.2007.10.044 fatcat:pttsyldeaffdzcvhqtvzwzlnau

Comparative Analysis of Metaheuristic Approaches for Makespan Minimization for No Wait Flow Shop Scheduling Problem

Laxmi A. Bewoor, V. Chandra Prakash, Sagar U. Sapkal
2017 International Journal of Electrical and Computer Engineering (IJECE)  
Tabu Search (TS), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are implemented for small and large sized problems and effectiveness of these techniques are measured with statistical metric  ...  This paper provides comparative analysis of various metaheuristic approaches for m-machine no wait flow shop scheduling (NWFSS) problem with makespan as an optimality criterion.  ...  [7] developed a discrete particle swarm optimization (DPSO) algorithm is presented to solve the no-wait flowshop scheduling problem with both makespan and total flow time criteria.  ... 
doi:10.11591/ijece.v7i1.pp417-423 fatcat:hqnuucsdvfbajmk2253le2obfy

A Two-Phase Hybrid Particle Swarm Optimization Algorithm for Solving Permutation Flow-Shop Scheduling Problem

Ko-Wei Huang, Chu-Sing Yang, Chun-Wei Tsai
2012 International Journal of Computer Applications  
In this paper, a two-phase hybrid particle swarm optimization algorithm (PRHPSO) is proposed for the permutation flowshop scheduling problem (PFSP) with the minimizing makespan measure.  ...  The smallest position value (SPV) rule is used for encoding the particles that enable PSO for suitable PFSP, and the NEH and Tabu search algorithms are used for initializing the particles.  ...  The objective of the makespan is to find permutation in permutation set Π, such that Eq. 2 shows: Meta-heuristic algorithms have been proposed for solving the PFSP and minimizing makespan.  ... 
doi:10.5120/7311-9883 fatcat:mpi3hg4gv5hohhfn6yocxdacya

Particle Swarm Optimization Algorithms for Two-stage Hybrid Flowshop Scheduling Problem with No-wait

Mageed A. Ghaleb, Ibrahim M. Alharkan
2019 Universal Journal of Electrical and Electronic Engineering  
We formulated the problem mathematically and proposed two discrete versions of the particle swarm optimization (PSO) to solve it.  ...  In this study, we solve the no-wait two-stage hybrid flowshop scheduling problem with total tardiness minimization as an optimizing criterion.  ...  The authors would like to thank all personnel involved in this work.  ... 
doi:10.13189/ujeee.2019.060202 fatcat:rb4hrvcmifcbvfou5vc2hxsrqa

A discrete differential evolution algorithm for the permutation flowshop scheduling problem

Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang
2008 Computers & industrial engineering  
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion.  ...  flowshop scheduling problem in the literature.  ...  For this reason, this research presents a discrete differential evolution (DDE) algorithm to solve the permutation flowshop scheduling problem with the makespan criterion.  ... 
doi:10.1016/j.cie.2008.03.003 fatcat:jzldelbhfff7bgcg35td2uyym4

A discrete differential evolution algorithm for the permutation flowshop scheduling problem

Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion.  ...  flowshop scheduling problem in the literature.  ...  For this reason, this research presents a discrete differential evolution (DDE) algorithm to solve the permutation flowshop scheduling problem with the makespan criterion.  ... 
doi:10.1145/1276958.1276976 dblp:conf/gecco/PanTL07 fatcat:exji6zfupbfmrajsi7kvfg4r3u

Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem

Mansour Eddaly, Bassem Jarboui, Patrick Siarry
2016 Journal of Computational Design and Engineering  
This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion.  ...  Finally, an iterated local search algorithm based on probabilistic perturbation is sequentially introduced to the particle swarm optimization algorithm for improving the quality of solution.  ...  In [28, 19] a discrete particle swarm optimization algorithm (DPSO) was proposed for solving permutation flowshop scheduling problem and no-wait flowshop scheduling problem respectively.  ... 
doi:10.1016/j.jcde.2016.05.001 fatcat:baxkgldqurbflceqmqcc7trmpq

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  
discrete job permutation.  ...  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  ...  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

An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems

Yamin Wang, Xiaoping Li, Ruben Ruiz, Shaochun Sui
2018 IEEE Transactions on Cybernetics  
In this paper, we study, for the first time, this scheduling setting with makespan minimization. We first propose a mathematical model and then we design a speed-up makespan calculation procedure.  ...  The problem can be regarded as a generalization of the traditional permutation flowshop and the no-wait flowshop.  ...  [1] presented a discrete particle swarm optimization (DPSO V ND ) algorithm for the NWFSP considering both makespan and total flow time criteria.  ... 
doi:10.1109/tcyb.2017.2707067 pmid:28600270 fatcat:n5k5qnununhclge4yvbyzj2erq

A new hybrid ant colony algorithm for scheduling of no-wait flowshop

Vahid Riahi, Morteza Kazemi
2016 Operational Research  
Owing to the problem is known to be NP-hard for more than two machines, a hybrid meta-heuristic algorithm based on ant colony optimization (ACO) and simulated annealing (SA) algorithm is improved.  ...  The no-wait flowshop is a variant of the wellknown flowshop scheduling problem where all processes follow the previous one without any interruption for operations of a job.  ...  They also hybridized the variable neighborhood descent (VND) algorithm and discrete particle swarm optimization (DPSO) to further enhance its searching ability.  ... 
doi:10.1007/s12351-016-0253-x fatcat:f3rvp6hkojb3pcp3ysxhxrbuu4

Simulated Annealing as an Intensification Component in Hybrid Population-based Metaheuristics [chapter]

Davide Anghinolfi, Massimo Paolucci
2008 Simulated Annealing  
makespan minimization in a permutation flow shop scheduling problem with the limited buffers between consecutive machines; in (He & Wang, 2007) , where constrained optimization problems are faced by  ...  The basic algorithm for a global optimization problem, corresponding to the minimization of a real objective function f(x) of a variable vector x defined on a n-dimensional space, uses a population (swarm  ...  We encourage readers to explore the application of Simulated Annealing in their work for the task of optimization.  ... 
doi:10.5772/5570 fatcat:ny3zbyvmlve45ff2ibvchhpyfi

Design and Analysis of Self-Adapted Task Scheduling Strategies in Wireless Sensor Networks

Wenzhong Guo, Naixue Xiong, Han-Chieh Chao, Sajid Hussain, Guolong Chen
2011 Sensors  
Then an effective discrete particle swarm optimization (PSO) algorithm for the dynamic alliance (DPSO-DA) with a well-designed particle position code and fitness function is proposed.  ...  OPEN ACCESS Sensors 2011, 11 6534 Keywords: wireless sensor networks; task scheduling; particle swarm optimization; dynamic alliance Related Work As mentioned in the previous section, energy consumption  ...  discrete PSO for the permutation flowshop sequencing problem with makespan criteria [27] have received the most attention.  ... 
doi:10.3390/s110706533 pmid:22163971 pmcid:PMC3231676 fatcat:rgtaycmlibal7m7ih6f263pbee

An estimation of distribution algorithm for lot-streaming flow shop problems with setup times

Quan-Ke Pan, Rubén Ruiz
2012 Omega : The International Journal of Management Science  
The objective is to minimize the maximum completion time or makespan.  ...  To solve this important practical problem, a novel estimation of distribution algorithm (EDA) is proposed with a job permutation based representation.  ...  Tseng and Liao (2008) developed a discrete particle swarm optimization (DPSO) algorithm.  ... 
doi:10.1016/j.omega.2011.05.002 fatcat:tl62yhgqmzc5ffomyev4tufh7e

Solving Scheduling Problem in a Distributed Manufacturing System Using a Discrete Fruit Fly Optimization Algorithm

Zhang, Liu, Tang, Królczyk, Li
2019 Energies  
A new scheduling optimization model is developed based on a discrete fruit fly optimization algorithm (DFOA).  ...  Hence, the proposed DFOA has a large probability to find an optimal solution to the scheduling optimization problem.  ...  Acknowledgments: The authors would like to thank the anonymous reviewers for their contribution to this paper. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/en12173260 fatcat:w7fkh3uz4bh33kdryffhytrvee
« Previous Showing results 1 — 15 out of 21 results