Solution by Genetic Algorithm In Regard to Sequence-Dependent Setup Time for Unrelated Parallel Machines Scheduling Problems

碩士 === 國立勤益科技大學 === 工業工程與管理系 === 95 === Some of the factory machines in these research cases are to be upgraded with new equipments, therefore, in certain work assignment, the machine configuration changes, i.e. new and old machines coexist together in particular production process. Some of the wor...

Full description

Bibliographic Details
Main Authors: Jeng-Wei Tseng, 曾政偉
Other Authors: Pei-Hsi Liu
Format: Others
Language:zh-TW
Published: 2007
Online Access:http://ndltd.ncl.edu.tw/handle/61545397683774752374
id ndltd-TW-095NCIT5031031
record_format oai_dc
spelling ndltd-TW-095NCIT50310312015-10-13T11:31:57Z http://ndltd.ncl.edu.tw/handle/61545397683774752374 Solution by Genetic Algorithm In Regard to Sequence-Dependent Setup Time for Unrelated Parallel Machines Scheduling Problems 基因演算法求解考量相依整備時間之非相關平行機排程問題 Jeng-Wei Tseng 曾政偉 碩士 國立勤益科技大學 工業工程與管理系 95 Some of the factory machines in these research cases are to be upgraded with new equipments, therefore, in certain work assignment, the machine configuration changes, i.e. new and old machines coexist together in particular production process. Some of the work machines are definitely performing faster than others. And certain manufacturing process is restricted to be carried out on certain machines. Accordingly, this research focuses on unrelated parallel machine scheduling problems and takes into considerations to minimize the overall delay for processing orders and the total production time. Another individual case needed to be considered is that, since the production materials are varied in nature, and the molds replaced must be cleaned prior production line change. As a consequence, the preparation time for every production line must be included as such. Subsequently, a parallel machine scheduling system configured on genetic algorithms can be used to find solutions according the superior search capabilities of the former. The parameter settings in genetic algorithm are critical to solution’s efficiency and effectiveness. Hence, Taguchi method is used to determine the parameter design and fine-tuning in the process of executing genetic algorithm, and eventually the most optimum parameter combination can be located. During this study, a case of manufacturer for lamps and lanterns was adopted to prove the effectiveness and stability of Taguchi method. And further comparisons were made against other frequently used traditional work scheduling methods. The final findings prove that, the configuration system proposed by this research can acquire fairly good scheduling results under the production environment from companies adopted as study case. Pei-Hsi Liu 劉培熙 2007 學位論文 ; thesis 133 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立勤益科技大學 === 工業工程與管理系 === 95 === Some of the factory machines in these research cases are to be upgraded with new equipments, therefore, in certain work assignment, the machine configuration changes, i.e. new and old machines coexist together in particular production process. Some of the work machines are definitely performing faster than others. And certain manufacturing process is restricted to be carried out on certain machines. Accordingly, this research focuses on unrelated parallel machine scheduling problems and takes into considerations to minimize the overall delay for processing orders and the total production time. Another individual case needed to be considered is that, since the production materials are varied in nature, and the molds replaced must be cleaned prior production line change. As a consequence, the preparation time for every production line must be included as such. Subsequently, a parallel machine scheduling system configured on genetic algorithms can be used to find solutions according the superior search capabilities of the former. The parameter settings in genetic algorithm are critical to solution’s efficiency and effectiveness. Hence, Taguchi method is used to determine the parameter design and fine-tuning in the process of executing genetic algorithm, and eventually the most optimum parameter combination can be located. During this study, a case of manufacturer for lamps and lanterns was adopted to prove the effectiveness and stability of Taguchi method. And further comparisons were made against other frequently used traditional work scheduling methods. The final findings prove that, the configuration system proposed by this research can acquire fairly good scheduling results under the production environment from companies adopted as study case.
author2 Pei-Hsi Liu
author_facet Pei-Hsi Liu
Jeng-Wei Tseng
曾政偉
author Jeng-Wei Tseng
曾政偉
spellingShingle Jeng-Wei Tseng
曾政偉
Solution by Genetic Algorithm In Regard to Sequence-Dependent Setup Time for Unrelated Parallel Machines Scheduling Problems
author_sort Jeng-Wei Tseng
title Solution by Genetic Algorithm In Regard to Sequence-Dependent Setup Time for Unrelated Parallel Machines Scheduling Problems
title_short Solution by Genetic Algorithm In Regard to Sequence-Dependent Setup Time for Unrelated Parallel Machines Scheduling Problems
title_full Solution by Genetic Algorithm In Regard to Sequence-Dependent Setup Time for Unrelated Parallel Machines Scheduling Problems
title_fullStr Solution by Genetic Algorithm In Regard to Sequence-Dependent Setup Time for Unrelated Parallel Machines Scheduling Problems
title_full_unstemmed Solution by Genetic Algorithm In Regard to Sequence-Dependent Setup Time for Unrelated Parallel Machines Scheduling Problems
title_sort solution by genetic algorithm in regard to sequence-dependent setup time for unrelated parallel machines scheduling problems
publishDate 2007
url http://ndltd.ncl.edu.tw/handle/61545397683774752374
work_keys_str_mv AT jengweitseng solutionbygeneticalgorithminregardtosequencedependentsetuptimeforunrelatedparallelmachinesschedulingproblems
AT céngzhèngwěi solutionbygeneticalgorithminregardtosequencedependentsetuptimeforunrelatedparallelmachinesschedulingproblems
AT jengweitseng jīyīnyǎnsuànfǎqiújiěkǎoliàngxiāngyīzhěngbèishíjiānzhīfēixiāngguānpíngxíngjīpáichéngwèntí
AT céngzhèngwěi jīyīnyǎnsuànfǎqiújiěkǎoliàngxiāngyīzhěngbèishíjiānzhīfēixiāngguānpíngxíngjīpáichéngwèntí
_version_ 1716845842993774592