Filters








709 Hits in 6.8 sec

A particle swarm optimization approach for permutation flow shop scheduling problem

T. Radha Ramanan, Muhammed Iqbal, K. Umarali
2014 International Journal for Simulation and Multidisciplinary Design Optimization  
Flow shop scheduling problem (FSSP) is a combinatorial optimization problem. This work, with the objective of optimizing the makespan of an FSSP uses a particle swarm optimization (PSO) approach.  ...  The results of Nawaz, Encore and Ham (NEH) heuristic are initialized to the PSO to direct the search into a quality space.  ...  The authors wish to thank the anonymous reviewers for giving their valuable suggestions in improving the quality of the paper.  ... 
doi:10.1051/smdo/2013006 fatcat:kmty5th4wjdjxggadwz3huquna

A new particle swarm optimization for multi-objective open shop scheduling

Hsing-Hung Lin, D. Y. Sha
2011 Journal of Information and Optimization Sciences  
This article proposes a particle swarm optimization (PSO) technique to address open-shop scheduling problems with multiple objectives.  ...  The results demonstrated that the algorithm performed better when only one swarm was used for all three objectives compared to the case where the swarm was divided into three sub-swarms for each objective  ...  Most published research has concentrated on developing heuristic algorithms to search for the optimal makespan of open-shop scheduling problems.  ... 
doi:10.1080/02522667.2011.10700119 fatcat:xzn5dk247red3nogsvkmixj2x4

A Local and Global Search Combine Particle Swarm Optimization Algorithm for Job-Shop Scheduling to Minimize Makespan

Zhigang Lian
2010 Discrete Dynamics in Nature and Society  
The Job-shop scheduling problem (JSSP) is a branch of production scheduling, which is among the hardest combinatorial optimization problems.  ...  The original particle swarm optimization algorithm (OPSOA), generally, is used to solve continuous problems, and rarely to optimize discrete problems such as JSSP.  ...  no. 09C403 , Humanities and Social Sciences Youth Fund Project of Ministry of Education Grant no. 09yjc630151 , and Shanghai Universities Select and Train Outstanding Young Teachers in special funds for  ... 
doi:10.1155/2010/838596 fatcat:ryvtyqbejjfepezd55vtgyfv7y

A Particle Swarm Optimization to Minimize Makespan for a Four-Stage Multiprocessor Open Shop with Dynamic Job Release Time

Hui-Mei Wang, Fuh-Der Chou
2015 World Journal of Engineering and Technology  
Due to the computational intractability, a particle swarm optimization (PSO) algorithm is proposed.  ...  The sorting machines scheduling problem can be treated as a four-stage multiprocessor open shop problem with dynamic job release, and the objective is minimizing the makespan in the paper.  ...  a particle swarm optimization (PSO) algorithm to solve MOSP problem is apparent in the literature when compared to other scheduling problems.  ... 
doi:10.4236/wjet.2015.33c012 fatcat:unuvcaoxb5dnpnardw2z2l6toy

Literature Review of Open Shop Scheduling Problems

Ellur Anand, Ramasamy Panneerselvam
2015 Intelligent Information Management  
sum of weighted tardiness of all jobs, minimization of weighted sum of tardy jobs, and miscellaneous measures of the open shop scheduling problem.  ...  ., minimization of makespan, minimization of sum of completion times of jobs, minimization of sum of weighted completion times of all jobs, minimization of total tardiness of all jobs, minimization of  ...  Acknowledgements The authors thank the anonymous referees for their constructive suggestions, which have improved the paper. References  ... 
doi:10.4236/iim.2015.71004 fatcat:shukynonjrfaleqiousjru3ari

Particle swarm optimization and discrete artificial bee colony algorithms for solving production scheduling problems

Tadeusz Witkowski
2019 Technical Sciences  
This paper shows the use of Discrete Artificial Bee Colony (DABC) and Particle Swarm Optimization (PSO) algorithm for solving the job shop scheduling problem (JSSP) with the objective of minimizing makespan  ...  Stochastic search techniques such as swarm and evolutionary algorithms are used to find a good solution.  ...  In this paper, Discrete Artificial Bee Colony (DABC) algorithm and Particle Swarm Optimization (PSO) algorithm are proposed for solving the job shop scheduling problem with the objective of minimizing  ... 
doi:10.31648/ts.4348 fatcat:bzsieh7zvzhkblmct3nnmbdcam

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

2019 International journal of recent technology and engineering  
Hence, this paper considered a unique hybrid algorithm which is the combination of the Grey Wolf and Chicken Swarm Optimization algorithm with the objective of minimization of makespan time and cost.  ...  The Job Shop Scheduling Problem (JSSP) is one of the major inconvenience models because it is the hardest combinatorial change in nature.  ...  Ziaee et al., (2014) proposed Job shop scheduling with makespan objective: A heuristic approach, this method minimizing the makespan of jobs for JSSP and discovered a solution for good schedules frequently  ... 
doi:10.35940/ijrte.d1055.1284s219 fatcat:62saexfs7zhyronoqdufmlyesi

A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem

D. Hajinejad, N. Salmasi, R. Mokhtari
2011 Scientia Iranica. International Journal of Science and Technology  
A Particle Swarm Optimization (PSO) algorithm for a Flow Shop Sequence Dependent Group Scheduling (FSDGS) problem, with minimization of total flow time as the criterion (F m |fmls, S plk , prmu| ∑ Cj),  ...  An encoding scheme based on Ranked Order Value (ROV) is developed, which converts the continuous position value of particles in PSO to job and group permutations.  ...  Since then, the PSO algorithm has been applied to a few scheduling problems. For instance, Lian et al. [9] proposed a similar PSO algorithm for permutation flow shop scheduling problems.  ... 
doi:10.1016/j.scient.2011.05.023 fatcat:nxmtugqjcbgddd2dmeemx5qpxi

Effective Utilization of Job Shop Schedulingin Auto Industries with the aid of SocialSpider Optimization

K. B. Gavali, Anand K. Bewoor, Debabrata Barik, Research Scholar, Department of Mechanical Engineering, Karpagam Academy of Higher Education, Coimbatore-641021, India, Department of Mechanical Engineering, Cummins College of Engineering, Pune-411052, India, Department of Mechanical Engineering, Karpagam Academy of Higher Education, Coimbatore-641021, India
2018 Journal of green engineering  
Jobs and machines are two attributes need to schedule for minimize makespan time, for each job we need to schedule the machine.  ...  To achieve minimized makespan time optimization involve in this process those are namely Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO) and Social Spider Optimization (SSO).  ...  The principle target of the job shop scheduling is to minimize the makespan time and find the optimal schedule of the operations.  ... 
doi:10.13052/jge1904-4720.842 fatcat:tibbklsp7vdkze5247w754vexi

A Hybrid Algorithm Based on Particle Swarm Optimization and Artificial Immune for an Assembly Job Shop Scheduling Problem

Hui Du, Dacheng Liu, Mian-hao Zhang
2016 Mathematical Problems in Engineering  
The aim of this research is to find the schedule which minimizes completion time of Assembly Job Shop Scheduling Problem (AJSSP).  ...  Since the complexity of AJSSP is NP-hard, a hybrid particle swarm optimization (HPSO) algorithm integrated PSO with Artificial Immune is proposed and developed to solve AJSSP.  ...  Yan et al. dealt with a two-stage assembly flow shop scheduling problem for minimizing the weighed sum of maximum makespan, earliness, and lateness [9] .  ... 
doi:10.1155/2016/3938679 fatcat:mdadhfwexrh3dh7obowhb6m7hu

An evolutionary approach for solving the job shop scheduling problem in a service industry

Milad Yousefi, Moslem Yousefi, Danial Hooshyar, Jefferson Ataide de Souza Oliveira
2015 IJAIN (International Journal of Advances in Intelligent Informatics)  
In this paper, an evolutionary-based approach based on the discrete particle swarm optimization (DPSO) algorithm is developed for finding the optimum schedule of a registration problem in a university.  ...  Since the selected case study has the characteristics of job shop scheduling problem (JSSP), it is categorized as a NP-hard problem which makes it difficult to be solved by conventional mathematical approaches  ...  The proposed method The problem at hand is a discrete NP-hard problem [17] , [18] . To provide a robust EA for solving this problem, a discrete particle swarm optimization approach is implemented.  ... 
doi:10.26555/ijain.v1i1.5 fatcat:ifq5ni3utfd5rpuybnb6r3z3oa

A Particle Swarm Optimization –Based Heuristic for Scheduling in FMS Review

S. V Kamble, K. S Kadam
2020 International journal of recent advances in engineering & technology  
This paper focus on the problem of simultaneous scheduling of machine and automated guided vehicle (AGV) in a flexible manufacturing system (FMS) so as to minimize the makespan The FMS scheduling problem  ...  Two optimization algorithms ( genetic algorithm and particle swarm algorithm) are compared and conclusions are presented  ...  PSO algorithm is very effective in generating optimal solution for FMS Abdelmaguid et al(2004) presented a new hybrid genetic algorithm for the simultaneous scheduling problem for the makespan minimization  ... 
doi:10.46564/ijraet.2020.v08i03.003 fatcat:ayzt46csivgofmn6rg4u6h32jq

An Efficient PSO Algorithm for Finding Pareto-Frontier in Multi-Objective Job Shop Scheduling Problems

Warisa Wisittipanich, Voratas Kachitvichyanukul
2013 Industrial Engineering & Management Systems  
The objective is to simultaneously minimize makespan and total tardiness of jobs.  ...  This paper proposes an efficient particle swarm optimization based approach to find a Pareto front for multi-objective JSP.  ...  Recently, Lei (2008) designed a Pareto archive particle swarm optimization (PAPSO) to simultaneously minimize makespan and total tardiness of jobs.  ... 
doi:10.7232/iems.2013.12.2.151 fatcat:bqj2blc63rfutphpy3t5bryqiu

The Impact of Local Search Strategies on Chaotic Hybrid Firefly Particle Swarm Optimization Algorithm in Flow-Shop Scheduling

Abdülkadir Gümüşçü, Serkan Kaya, Mehmet Emin Tenekeci, İzzettin Hakan Karaçizmeli, İbrahim Berkan Aydilek
2021 Journal of King Saud University: Computer and Information Sciences  
This study aimed to investigate the effect of local search strategies on the solution performance of hybrid firefly and particle swarm optimization algorithm, developed using chaotic local search.  ...  Therefore, scheduling remains an important area of study for researchers.  ...  Acknowledgements It will be added after the evaluation due to the double-blind review processs.  ... 
doi:10.1016/j.jksuci.2021.07.017 fatcat:kootvwmpkfcrnfq5lyaqitpuw4

Hybrid Multi-Objective Particle Swarm Optimization for Flexible Job Shop Scheduling Problem

S. V. Kamble, S. U. Mane, A. J. Umbarkar
2015 International Journal of Intelligent Systems and Applications  
Hybrid algorithm based on Particle Swarm Optimization (PSO) and Simulated annealing (SA) is proposed, to solve Flexible Job Shop Scheduling with five objectives to be minimized simultaneously: makespan  ...  A hybrid multi-objective PSO (MPSO) and SA algorithm is proposed to identify an approximation of the pareto front for Flexible job shop scheduling (FJSSP).  ...  Our special thanks to S. Xinyu, W. Liu, L. Qiong and Z. Chaoyong for their work on Job shop scheduling using particle swarm optimization Algorithm published in various journals and conferences.  ... 
doi:10.5815/ijisa.2015.04.08 fatcat:kigqo7yyn5gszj64uysk3qy3u4
« Previous Showing results 1 — 15 out of 709 results