Scheduling Tardiness Constrained Flow Shop with Simultaneously Loaded Stations Using Genetic Algorithm

2020 ◽  
Author(s):  
Donald Davendra ◽  
Frank Hermann ◽  
Magdalena Bialic-Davendra
Keyword(s):  
Genetic Algorithm ◽  
Flow Shop ◽  
Constrained Flow

scholarly journals Multimodal Optimization of Permutation Flow-Shop Scheduling Problems Using A Clustering-Genetic-Algorithm-Based Approach

2021 ◽  
Vol 11 (8) ◽  
pp. 3388
Author(s):  
Pan Zou ◽  
Manik Rajora ◽  
Steven Y. Liang
Keyword(s):  
Genetic Algorithm ◽  
Clustering Algorithm ◽  
Flow Shop ◽  
Optimal Schedule ◽  
Flow Shop Scheduling ◽  
Multimodal Optimization ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Permutation Flow Shop ◽  
Global Optima

Though many techniques were proposed for the optimization of Permutation Flow-Shop Scheduling Problem (PFSSP), current techniques only provide a single optimal schedule. Therefore, a new algorithm is proposed, by combining the k-means clustering algorithm and Genetic Algorithm (GA), for the multimodal optimization of PFSSP. In the proposed algorithm, the k-means clustering algorithm is first utilized to cluster the individuals of every generation into different clusters, based on some machine-sequence-related features. Next, the operators of GA are applied to the individuals belonging to the same cluster to find multiple global optima. Unlike standard GA, where all individuals belong to the same cluster, in the proposed approach, these are split into multiple clusters and the crossover operator is restricted to the individuals belonging to the same cluster. Doing so, enabled the proposed algorithm to potentially find multiple global optima in each cluster. The performance of the proposed algorithm was evaluated by its application to the multimodal optimization of benchmark PFSSP. The results obtained were also compared to the results obtained when other niching techniques such as clearing method, sharing fitness, and a hybrid of the proposed approach and sharing fitness were used. The results of the case studies showed that the proposed algorithm was able to consistently converge to better optimal solutions than the other three algorithms.

A Two-Stage Hybrid Algorithm for Flexible Job-Shop Scheduling

2011 ◽  
Vol 268-270 ◽  
pp. 476-481
Author(s):  
Li Gao ◽  
Ke Lin Xu ◽  
Wei Zhu ◽  
Na Na Yang
Keyword(s):  
Genetic Algorithm ◽  
Hybrid Algorithm ◽  
Job Shop ◽  
Flow Shop ◽  
Job Shop Scheduling ◽  
Selection Procedure ◽  
Dynamic Programming Method ◽  
Two Stage ◽  
Simulated Annealing Genetic Algorithm ◽  
Mutation Operators

A mathematical model was constructed with two objectives. A two-stage hybrid algorithm was developed for solving this problem. At first, the man-hour optimization based on genetic algorithm and dynamic programming method, the model decomposes the flow shop into two layers: sub-layer and patrilineal layer. On the basis of the man-hour optimization，A simulated annealing genetic algorithm was proposed to optimize the sequence of operations. A new selection procedure was proposed and hybrid crossover operators and mutation operators were adopted. A benchmark problem solving result indicates that the proposed algorithm is effective.

Memetic Algorithm Approach to Two-Stage Hybrid Flow Shop Scheduling Problem with Identical Parallel Machines

2013 ◽  
Vol 651 ◽  
pp. 548-552
Author(s):  
Parinya Kaweegitbundit
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Parallel Machines ◽  
Flow Shop ◽  
Memetic Algorithm ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problems ◽  
Two Stage ◽  
Hybrid Flow Shop Scheduling

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.

scholarly journals EVOLUTIONARY ALGORITHMS FOR RESOURCE CONSTRAINED NON-SERIAL MIXED FLOW SHOPS

2003 ◽  
Vol 03 (04) ◽  
pp. 411-435 ◽  
Author(s):  
ROBERT L. BURDETT ◽  
ERHAN KOZAN
Keyword(s):  
Evolutionary Algorithms ◽  
Numerical Investigation ◽  
Flow Shop ◽  
Resource Constrained ◽  
Mixed Flow ◽  
Flow Shops ◽  
Constrained Flow

In this paper the resource-constrained flow shop (RCF) problem is addressed. A number of realistic extensions are incorporated, including non-serial precedence requirements, mixed flow shop situations, and the distribution of the human workforce among a number of pre-determined groups. The RCF is then solved by meta-heuristics, primarily of the evolutionary type. An extensive numerical investigation, including a case study of a particular industrial situation, details the implementation and execution of the heuristics, and the efficiency of the proposed algorithms.

scholarly journals Analisis Perbandingan Aggregat Of Function (AOF) dengan Non-Dominated Sorting Genetic Algorithm (NSGA-II) dalam Menentukan Optimasi Multi-Objective pada Penjadwalan Mesin Produksi Flow Shop

2018 ◽  
Vol 17 (2) ◽  
pp. 158
Author(s):  
Fifin Sonata ◽  
Dede Prabowo Wiguna
Keyword(s):  
Genetic Algorithm ◽  
Flow Shop ◽  
Total Tardiness ◽  
Pareto Optimal ◽  
Nsga Ii ◽  
Trade Off ◽  
Multi Objective

Penjadwalan mesin produksi dalam dunia industri memiliki peranan penting sebagai bentuk pengambilan keputusan. Salah satu jenis sistem penjadwalan mesin produksi adalah sistem penjadwalan mesin produksi tipe flow shop. Dalam penjadwalan flow shop, terdapat sejumlah pekerjaan (job) yang tiap-tiap job memiliki urutan pekerjaan mesin yang sama. Optimasi penjadwalan mesin produksi flow shop berkaitan dengan penyusunan penjadwalan mesin yang mempertimbangkan 2 objek yaitu makespan dan total tardiness. Optimasi kedua permasalahan tersebut merupakan optimasi yang bertolak belakang sehingga diperlukan model yang mengintegrasikan permasalahan tersebut dengan optimasi multi-objective A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimazitaion : NSGA-II. Dalam penelitian ini akan dibandingkan 2 buah metode yaitu Aggregat Of Function (AOF) dengan NSGA-II agar dapat terlihat nilai solusinya. Penyelesaian penjadwalan mesin produksi flow shop dengan algoritma NSGA-II untuk membangun jadwal dengan meminimalkan makespan dan total tardiness.Tujuan yang ingin dicapai adalah mengetahui bahwa model yang dikembangkan akan memberikan solusi penjadwalan mesin produksi flow shop yang efisien berupa solusi pareto optimal yang dapat memberikan sekumpulan solusi alternatif bagi pengambil keputusan dalam membuat penjadwalan mesin produksi yang diharapkan. Solusi pareto optimal yang dihasilkan merupakan solusi optimasi multi-objective yang optimal dengan trade-off terhadap seluruh objek, sehingga seluruh solusi pareto optimal sama baiknya.

Sign in / Sign up

Export Citation Format

Share Document