scholarly journals Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce

2010 ◽  
Author(s):  
Di-Wei Huang ◽  
Jimmy Lin
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling

The Simulation Optimization for Job-Shop Scheduling Based on Plant Simulation Using Genetic Algorithm

2012 ◽  
Vol 217-219 ◽  
pp. 1444-1448
Author(s):  
Xiang Ke Tian ◽  
Jian Wang
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Optimization Problems ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Combinatorial Optimization Problems ◽  
Plant Simulation

The job-shop scheduling problem (JSP), which is one of the best-known machine scheduling problems, is among the hardest combinatorial optimization problems. In this paper, the key technology of building simulation model in Plant Simulation is researched and also the build-in genetic algorithm of optimizing module is used to optimize job-shop scheduling, which can assure the scientific decision. At last, an example is used to illustrate the optimization process of the Job-Shop scheduling problem with Plant Simulation genetic algorithm modules.

A metaheuristic technique for energy-efficiency in job-shop scheduling

2016 ◽  
Vol 31 (5) ◽  
pp. 475-485 ◽  
Author(s):  
Joan Escamilla ◽  
Miguel A. Salido ◽  
Adriana Giret ◽  
Federico Barber
Keyword(s):  
Genetic Algorithm ◽  
Energy Efficiency ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Real Life ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Extended Version ◽  
Reasonable Time ◽  
Shop Scheduling

AbstractMany real life problems can be modeled as a scheduling problem. The main objective of these problems is to obtain optimal solutions in terms of processing time, cost and quality. Nowadays, energy-efficiency is also taken into consideration. However, these problems are NP-hard, so many search techniques are not able to obtain a solution in a reasonable time. In this paper, a genetic algorithm is developed to solve an extended version of the classical job-shop scheduling problem. In the extended version, each operation has to be executed by one machine and this machine can work at different speed rates. The machines consume different amounts of energy to process tasks at different rates. The evaluation section shows that a powerful commercial tools for solving scheduling problems was not able to solve large instances in a reasonable time, meanwhile our genetic algorithm was able to solve all instances with a good solution quality.

scholarly journals Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems

2018 ◽  
Vol 2018 ◽  
pp. 1-32 ◽  
Author(s):  
Muhammad Kamal Amjad ◽  
Shahid Ikramullah Butt ◽  
Rubeena Kousar ◽  
Riaz Ahmad ◽  
Mujtaba Hassan Agha ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Future Research ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

Flexible Job Shop Scheduling Problem (FJSSP) is an extension of the classical Job Shop Scheduling Problem (JSSP). The FJSSP is known to be NP-hard problem with regard to optimization and it is very difficult to find reasonably accurate solutions of the problem instances in a rational time. Extensive research has been carried out in this area especially over the span of the last 20 years in which the hybrid approaches involving Genetic Algorithm (GA) have gained the most popularity. Keeping in view this aspect, this article presents a comprehensive literature review of the FJSSPs solved using the GA. The survey is further extended by the inclusion of the hybrid GA (hGA) techniques used in the solution of the problem. This review will give readers an insight into use of certain parameters in their future research along with future research directions.

Sign in / Sign up

Export Citation Format

Share Document