1,340 Hits in 5.8 sec

Hybrid Fruit Fly Algorithm Based on Bi-objective Job-shop Scheduling

Yue-xia ZHANG, Sheng-wang YIN, Jia-cheng JIN
2018 DEStech Transactions on Computer Science and Engineering  
This paper proposes a hybrid fruit fly algorithm based on bi-objective job-shop scheduling.  ...  Based on the existing fruit fly optimization algorithm, the paper presents a hybrid step-size olfactory search method to improve search efficiency.  ...  Therefore, it is of great significance for research on multi-objective optimization in a job-shop. There are several methods to solve multi-objective scheduling problems in a job-shop.  ... 
doi:10.12783/dtcse/iece2018/26642 fatcat:feb3nfe2wrf3hfm737wqt3mkp4

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.  ...  We assign fitness based dominance relation and weighted aggregate in the genetic algorithm and local search, respectively.We take a variable neighborhood search algorithm as a local improving procedure  ...  Dominance-based and weighted aggregate fitness assignment methods are used in the parts of genetic algorithm and local search, respectively.  ... 
doi:10.5829/idosi.ije.2013.26.02b.11 fatcat:azlm2xhzw5cmlggz3ajbnajqoq

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  
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).  ...  Pareto front and crowding distance is used for identify the fitness of particle. MPSO is significant to global search and SA used to local search.  ...  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


Sultana Parveen, Hafiz Ullah
2011 Journal of Mechanical Engineering  
Scheduling is widely studied and complex combinatorial optimization problems. A vast amount of research has been performed in this particular area to effectively schedule jobs for various objectives.  ...  This paper discusses the more recent literature on scheduling using multi criteria decision making (MCDM). This article addresses both job-shop and flow-shop scheduling problem.  ...  One machine in job shop objective) and are combined by the selection operator for obtaining new solutions.  ... 
doi:10.3329/jme.v41i2.7508 fatcat:jtdncw2ldjbrxo3tf4w2ve2wny

Flexible Job Shop Scheduling Using a Multiobjective Memetic Algorithm [chapter]

Tsung-Che Chiang, Hsiao-Jou Lin
2012 Lecture Notes in Computer Science  
Dominance-based and aggregation-based fitness assignment methods are used in the parts of genetic algorithm and local search, respectively.  ...  This paper addresses the flexible job shop scheduling problem with minimization of the makespan, maximum machine workload, and total machine workload as the objectives.  ...  Selection is usually done based on the fitness value. There are many good fitness assignment methods for multiobjective optimization, for example, NSGA-II [22] and SPEA2 [24] .  ... 
doi:10.1007/978-3-642-25944-9_7 fatcat:scmwcnmgenaufkkrd4odg5plp4

Inventory Based Bi-Objective Flow Shop Scheduling Model and Its Hybrid Genetic Algorithm

Ren Qing-dao-er-ji, Yuping Wang
2013 Mathematical Problems in Engineering  
Flow shop scheduling problem is a typical NP-hard problem, and the researchers have established many different multi-objective models for this problem, but none of these models have taken the inventory  ...  In this paper, an inventory based bi-objective flow shop scheduling model was proposed, in which both the total completion time and the inventory capacity were as objectives to be optimized simultaneously  ...  [7] proposed a parallel exact method to solve bi-objective permutation flow shop problem.  ... 
doi:10.1155/2013/976065 fatcat:dod77ledzjao7foxkyx64f76ga

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

Warisa Wisittipanich, Voratas Kachitvichyanukul
2013 Industrial Engineering & Management Systems  
This paper proposes an efficient particle swarm optimization based approach to find a Pareto front for multi-objective JSP.  ...  In the past decades, several algorithms based on evolutionary approaches have been proposed for solving job shop scheduling problems (JSP), which is well-known as one of the most difficult combinatorial  ...  Generally, the methods for solving multi-objective problems can be classified into two types: non-Pareto-based and Pareto-based approaches.  ... 
doi:10.7232/iems.2013.12.2.151 fatcat:bqj2blc63rfutphpy3t5bryqiu

A Hybrid Pareto Based Multi Objective Evolutionary Algorithm for a Partial Flexible Open-Shop Scheduling Problem

N. Jananeeswari, Dr. S. Jayakumar, Dr. M. Nagamani
2017 IOSR Journal of Mathematics  
In this paper, A Partial flexible, open-shop scheduling problem (FOSP) is a combinatorial optimization problem.  ...  This work, with the objective of optimizing the makespan of an FOSP uses a hybrid Pareto based optimization (HPBO) approach. The problems are tested on Taillard's benchmark problems.  ...  Acknowledgments The authors wish to thank the unknown analysts for giving their important proposals in improving the quality of the best paper.  ... 
doi:10.9790/5728-1301023238 fatcat:gvdnd2n4nvhmppr6jq3zvqzk4m

A multi-objective particle swarm for a flow shop scheduling problem

A. R. Rahimi-Vahed, S. M. Mirghorbani
2006 Journal of combinatorial optimization  
specify the superior particle's position vector in the swarm, is designed and used for finding locally Pareto-optimal frontier of the problem.  ...  Since a flow shop scheduling problem has been proved to be NP-hard in strong sense, an effective multi-objective particle swarm (MOPS), exploiting a new concept of the Ideal Point and a new approach to  ...  Acknowledgmets The authors would like to sincerely thank the two anonymous referees for their valuable comments on the early version of this paper.  ... 
doi:10.1007/s10878-006-9015-7 fatcat:y3o646i7jnffvpnllhm6qsc42a

Using evolutionary computation and local search to solve multi-objective flexible job shop problems

Nhu Binh Ho, Joc Cing Tay
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
Finding realistic schedules for Flexible Job Shop Problems has attracted many researchers recently due to its NP-hardness.  ...  In this paper, we present an efficient approach for solving the multiobjective flexible job shop by combining Evolutionary Algorithm and Guided Local Search.  ...  Recently, many researchers have studied the combination of EA and Local Search for solving multi-objective scheduling problems.  ... 
doi:10.1145/1276958.1277121 dblp:conf/gecco/HoT07 fatcat:auvjeea4m5cafc3jv7pd2btvzm

Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems

Jun-Qing Li, Quan-Ke Pan, Kai-Zhou Gao
2011 The International Journal of Advanced Manufacturing Technology  
This paper presents a hybrid Pareto-based discrete artificial bee colony algorithm for solving the multi-objective flexible job shop scheduling problem.  ...  Keywords Flexbile job shop scheduling problem . Discrete artificial bee colony . Multi-objective optimization . Crossover operator  ...  The job shop scheduling problem (JSP) is one of the scheduling problems. The flexible job shop scheduling problem (FJSP), as a branch of the classical JSP, has been studied in very recent years.  ... 
doi:10.1007/s00170-010-3140-2 fatcat:madyavz3mza7pd452zwc2ltahy

A Survey of Solving Approaches for Multiple Objective Flexible Job Shop Scheduling Problems

Krasimira Genova, Leoneed Kirilov, Vassil Guliashki
2015 Cybernetics and Information Technologies  
Many real life scheduling problems can be formulated as Flexible Job Shop Scheduling Problems (FJSSPs) which simultaneously optimize several conflicting criteria.  ...  Usually hybrid metaheuristic algorithms are proposed for large dimensional real life problems and they outlay the tendency for the future developments of efficient solution approaches for multiple objective  ...  the purposes of development of software tool for generating efficient schedules by an innovative method for multiple objective optimization in discrete manufacturing within the scope of small and medium  ... 
doi:10.1515/cait-2015-0025 fatcat:aqgxekvzpbd4rf6uoyta655xi4

Solving a Multi-Objective No-Wait Flow Shop Problem by a Hybrid Multi-Objective Immune Algorithm [chapter]

R. Tavakkoli-Moghaddam, A. Rahimi-Vahed, A. Hossein
2007 Multiprocessor Scheduling, Theory and Applications  
., (2004) proposed a neural networks-based tabu search method for the flow shop scheduling problem, in which the objective is to minimize makespan.  ...  To tackle this problem, an effective multi-objective immune algorithm (MOIA) is designed for searching locally Pareto-optimal frontier.  ...  This volume contains four major parts that cover the following directions: the state of the art in theory and algorithms for classical and non-standard scheduling problems; new exact optimization algorithms  ... 
doi:10.5772/5222 fatcat:s3jeuyxlbfe6papnyoeybltlzq

Pareto- Front Generation by Classical and Meta-heuristic Methods in Flexible Job Shop Scheduling with Multiple Objectives

Maryam Ghasemi, Ali Farzan
2017 International Journal of Computer Applications  
To generate Pareto-fronts, a search algorithm uses mechanism of variable weights and random selection to change directions in search spaces.  ...  According that, job shop scheduling is one of NPhard problems to solve multi-objective decision making approaches. So, the problem is known as uncertain with many variables in optimal solution view.  ...  The proposed method is used local and general search of genetic algorithm and Tabu search algorithm to explorations.  ... 
doi:10.5120/ijca2017913476 fatcat:xhnyp5gqizhiniuyj4a72onyi4

NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems

Tsung-Che Chiang, Hsueh-Chien Cheng, Li-Chen Fu
2011 Expert systems with applications  
We take NEH as a local improving procedure in NNMA and propose several adaptations including the acceptance criterion and job-insertion ordering to deal with multiple objectives and to improve its performance  ...  The permutation flow shop scheduling problem is addressed in this paper. Two objectives, minimization of makespan and total flow time, are considered.  ...  Their algorithm is featured by doing local search based on Pareto dominance in a population-based (rather than individual-based) manner.  ... 
doi:10.1016/j.eswa.2010.11.022 fatcat:3d7zfhzfq5dmrdi2y2qvfoy2uy
« Previous Showing results 1 — 15 out of 1,340 results