A new efficient biased random key genetic algorithm for open shop scheduling with routing by capacitated single vehicle and makespan minimization

2021 ◽  
Vol 104 ◽  
pp. 104373
Author(s):  
Levi R. Abreu ◽  
Roberto F. Tavares-Neto ◽  
Marcelo S. Nagano
Keyword(s):  
Genetic Algorithm ◽  
Open Shop ◽  
Makespan Minimization ◽  
Open Shop Scheduling ◽  
Shop Scheduling ◽  
Single Vehicle

Research on Open Shop Scheduling Based on Genetic Algorithm

2013 ◽  
Vol 655-657 ◽  
pp. 1670-1674
Author(s):  
Yong Zhan ◽  
Yu Guang Zhong ◽  
Hai Tao Zhu
Keyword(s):  
Genetic Algorithm ◽  
Programming Model ◽  
Open Shop ◽  
Mixed Integer ◽  
Initial Population ◽  
Open Shop Scheduling ◽  
Shop Scheduling ◽  
Np Problem ◽  
Quality Of The Population

Open shop scheduling problem is a typical NP problem with wide engineering background. It is of importance with respect of theory and application. In this paper, a mixed integer programming model was established with the objective to minimize the makespan based on the characteristics of the open shop, and a evolution genetic algorithm(EGA) was proposed. The representation of chromosome used in this paper was composed of two layers: operation layer and machine layer, which can be encoded and decoded easily. In generating initial population, DS/LTRP heuristic was used in order to improve the quality of the population. And particular crossover operation was proposed, which generated multiple offspring at a time, so that the efficiency of the algorithm can be well improved. At last, the proposed algorithm was tested on taillard benchmark, and numerical example showed good result.

Extended Genetic Algorithm for solving open-shop scheduling problem

2018 ◽  
Vol 23 (13) ◽  
pp. 5099-5116 ◽  
Author(s):  
Ali Asghar Rahmani Hosseinabadi ◽  
Javad Vahidi ◽  
Behzad Saemi ◽  
Arun Kumar Sangaiah ◽  
Mohamed Elhoseny
Keyword(s):  
Genetic Algorithm ◽  
Open Shop ◽  
Scheduling Problem ◽  
Open Shop Scheduling ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document