scholarly journals Solving Job Scheduling Problem Using Fireworks Algorithm

2019 ◽  
Vol 11 (2) ◽  
pp. 1-8 ◽  
Author(s):  
Jamal N. Hasoon ◽  
Rehab Hassan
Keyword(s):  
Job Scheduling ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Scheduling Problem ◽  
Improve Performance ◽  
Fireworks Algorithm ◽  
Np Hard Problem ◽  
Job Scheduling Problem ◽  
Optimum Solution

Scheduling is critical part in most creation frameworks and information processing as sequencing of tasks or jobs framework executed on a grouping of processors.  One of the NP-hard problem is “Job Shop Scheduling Problem”. In this work, a method of optimization proposed called “Fireworks Algorithm”. The solutions divided into fireworks and each one applied sparks to find the best solution. For some selected spark applied Gaussian mutation to find enhanced solution and find optimum solution.   FWA tested on dataset to improve performance and it do well with respect to some other algorithm like Meerkat Clan Algorithm (MCA), Camel Herds Algorithm) CHA(, and Cukoo Search Algorithm (CSA).

scholarly journals Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints

2020 ◽  
Author(s):  
Moussa Abderrahim ◽  
Abdelghani Bekrar ◽  
Damien Trentesaux ◽  
Nassima Aissani ◽  
Karim Bouamrane
Keyword(s):  
Manufacturing Systems ◽  
Variable Neighborhood Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Efficient Production ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

AbstractIn job-shop manufacturing systems, an efficient production schedule acts to reduce unnecessary costs and better manage resources. For the same purposes, modern manufacturing cells, in compliance with industry 4.0 concepts, use material handling systems in order to allow more control on the transport tasks. In this paper, a job-shop scheduling problem in vehicle based manufacturing facility that is mainly related to job assignment to resources is addressed. The considered job-shop production cell has two types of resources: processing resources that accomplish fabrication tasks for specific products, and transporting resources that assure parts’ transport to the processing area. A Variable Neighborhood Search algorithm is used to schedule product manufacturing and handling tasks in the aim to minimize the maximum completion time of a job set and an improved lower bound with new calculation method is presented. Experimental tests are conducted to evaluate the efficiency of the proposed approach.

Modeling and Simulation of Holonic Meta-Algorithm in Scheduling Process Using PERT Technique − Optimization in Job Shop Scheduling Problem

2015 ◽  
Vol 760 ◽  
pp. 199-204
Author(s):  
Mircea Gorgoi ◽  
Corneliu Neagu
Keyword(s):  
Objective Function ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
New Approach ◽  
Shop Scheduling ◽  
Technique Optimization ◽  
Optimum Solution

In generally scheduling can be viewed as optimization, bound by sequence and resource constrain and the minimization of the makespan is often used as the criterion. In this paper minimization of the makespan or complete time will be used such as an objective function and not the criterion of the decision. The new approach use heuristic elementary priority dispatch rules as the criterion of the decision. This research purpose a new methodology which use a specific elements of PERT techniques to find the optimum solution. New approach establish a solution's space where are find the all solution of the problem. Determination of the solution's space is realized by a meta-algorithm which take in account all the variant of the solutions of the process.

scholarly journals A Tabu-Genetic Hybrid Search Algorithm for Job-shop Scheduling Problem

2019 ◽  
Vol 95 ◽  
pp. 04007
Author(s):  
Yan Ge ◽  
Aimin Wang ◽  
Zijin Zhao ◽  
Jieran Ye
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Search Performance ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Hybrid Search ◽  
Shop Scheduling

To deal with the job-shop scheduling problem (JSP), a tabu-genetic hybrid search algorithm is proposed. The algorithm generates several initial solutions distributed in the whole solution space for tabu search by genetic algorithm, which avoids the over-dependence on the initial solution of tabu search algorithm. With the mechanism mentioned above, the algorithm proposed has both global search performance of genetic algorithm and local search performance of labu search algorithm. Finally, a program was developed with the achral data of FT (10x 10). to verify the feasibility and effectiveness of the algorithm. The result shows that the algorithm achieves satisfactory results in all indexes mentioned above.

Sign in / Sign up

Export Citation Format

Share Document