Applying Genetic Algorithm to Schedule Brewery Production
碩士 === 國立中央大學 === 工業管理研究所 === 105 === Abstract Scheduling is one of the most important problems in any manufacturing industry. Therefore, the problem has been studied extendedly. Since, the scheduling problem is classified as NP-hard problem, which means the time required for finding the optimal sol...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2017
|
Online Access: | http://ndltd.ncl.edu.tw/handle/p465f9 |
id |
ndltd-TW-105NCU05041042 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-105NCU050410422019-05-16T00:08:08Z http://ndltd.ncl.edu.tw/handle/p465f9 Applying Genetic Algorithm to Schedule Brewery Production 以基因演算法規劃啤酒釀造排程 Bui Xuan Toan 裴春全 碩士 國立中央大學 工業管理研究所 105 Abstract Scheduling is one of the most important problems in any manufacturing industry. Therefore, the problem has been studied extendedly. Since, the scheduling problem is classified as NP-hard problem, which means the time required for finding the optimal solution of the problem is grown exponentially with the size of the problem. Therefore, it is unrealistic to find optimal solution for the scheduling problem in the scene of the real world industrial case, even with today advanced computer system. There are many heuristic algorithms have been proposal to solve the scheduling problem. They are beam search, local search technique, tabular search and Genetic Algorithm (GA), to name a few. In recent years, GA has become a noticeable candidate for solving the scheduling problem effectively. The idea of mimicking the evolutionary process is very interesting to researchers. And the recent advanced in heuristic GA has sparked more attention toward new research and application in the field of GA. In Brewery industry, the fermentation process is the most crucial components of the whole manufacturing process. It will decide the quality, taste of the products as well as the productivity of the production line. Since, the fermentation time can take up to 41 days, and the requirement time is varying a lot between different types of beers, therefore finding a good scheduling solution to dealing with this complexity is crucial for beer manufacturers. This research will propose a GA to solve the scheduling problem in beer production. The proposed methodology will serve as a planning and analysis tool to utilize assets (tanks, filling lines) effectively, reduce congestion and synchronize the production process between the two production stages (liquid preparation and bottling). Keywords: scheduling, lot sizing, brewery industry, two-stage production, GA. Chi-Tai Wang 王啟泰 2017 學位論文 ; thesis 91 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中央大學 === 工業管理研究所 === 105 === Abstract
Scheduling is one of the most important problems in any manufacturing industry.
Therefore, the problem has been studied extendedly. Since, the scheduling problem is classified
as NP-hard problem, which means the time required for finding the optimal solution of the
problem is grown exponentially with the size of the problem. Therefore, it is unrealistic to find
optimal solution for the scheduling problem in the scene of the real world industrial case, even
with today advanced computer system.
There are many heuristic algorithms have been proposal to solve the scheduling problem.
They are beam search, local search technique, tabular search and Genetic Algorithm (GA), to
name a few. In recent years, GA has become a noticeable candidate for solving the scheduling
problem effectively. The idea of mimicking the evolutionary process is very interesting to
researchers. And the recent advanced in heuristic GA has sparked more attention toward new
research and application in the field of GA.
In Brewery industry, the fermentation process is the most crucial components of the whole
manufacturing process. It will decide the quality, taste of the products as well as the
productivity of the production line. Since, the fermentation time can take up to 41 days, and the
requirement time is varying a lot between different types of beers, therefore finding a good
scheduling solution to dealing with this complexity is crucial for beer manufacturers. This
research will propose a GA to solve the scheduling problem in beer production. The proposed
methodology will serve as a planning and analysis tool to utilize assets (tanks, filling lines)
effectively, reduce congestion and synchronize the production process between the two
production stages (liquid preparation and bottling).
Keywords: scheduling, lot sizing, brewery industry, two-stage production, GA.
|
author2 |
Chi-Tai Wang |
author_facet |
Chi-Tai Wang Bui Xuan Toan 裴春全 |
author |
Bui Xuan Toan 裴春全 |
spellingShingle |
Bui Xuan Toan 裴春全 Applying Genetic Algorithm to Schedule Brewery Production |
author_sort |
Bui Xuan Toan |
title |
Applying Genetic Algorithm to Schedule Brewery Production |
title_short |
Applying Genetic Algorithm to Schedule Brewery Production |
title_full |
Applying Genetic Algorithm to Schedule Brewery Production |
title_fullStr |
Applying Genetic Algorithm to Schedule Brewery Production |
title_full_unstemmed |
Applying Genetic Algorithm to Schedule Brewery Production |
title_sort |
applying genetic algorithm to schedule brewery production |
publishDate |
2017 |
url |
http://ndltd.ncl.edu.tw/handle/p465f9 |
work_keys_str_mv |
AT buixuantoan applyinggeneticalgorithmtoschedulebreweryproduction AT péichūnquán applyinggeneticalgorithmtoschedulebreweryproduction AT buixuantoan yǐjīyīnyǎnsuànfǎguīhuàpíjiǔniàngzàopáichéng AT péichūnquán yǐjīyīnyǎnsuànfǎguīhuàpíjiǔniàngzàopáichéng |
_version_ |
1719159883487510528 |