A study on dynamic scheduling of multiobjective parallel machine - Example of Printed Circuit Board
碩士 === 輔仁大學 === 應用統計學研究所 === 92 === Manufacturing industry changes from that salesman take the product which has been made to sale to that industry manufacture the product which is needed after market research﹒The faster consumer’s demand varies ﹐the shorter the cycle time of product becomes﹒So the...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2004
|
Online Access: | http://ndltd.ncl.edu.tw/handle/30285623657622137058 |
id |
ndltd-TW-092FJU00506042 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-092FJU005060422016-01-04T04:09:16Z http://ndltd.ncl.edu.tw/handle/30285623657622137058 A study on dynamic scheduling of multiobjective parallel machine - Example of Printed Circuit Board 多目標平行機台之動態排程之研究-以印刷電路板為例 Yeh,Tsai-Jung 葉財榮 碩士 輔仁大學 應用統計學研究所 92 Manufacturing industry changes from that salesman take the product which has been made to sale to that industry manufacture the product which is needed after market research﹒The faster consumer’s demand varies ﹐the shorter the cycle time of product becomes﹒So the deadline becomes more and more shorter﹒It is important for arrangement of work﹒The way manufacturing industry respond to this condition is changing faster as it can﹒It is not easy to chang﹐especially for order manufacture method and the industry which has complicated process﹒It is important for the type of Printed Circuit Board(PCB) to schedule﹒So this study is about product schedule the purpose of this study is minimization of line mix of total flow-time and tardiness about parallel machine dynamic scheduling﹒The indicators of the problem of product schedule are Total Flow Time﹑Total Tardiness﹑Number Of Tardy Jobs﹑Maximum Tardiness﹑Makespan﹒For Printed Circuit Board(PCB) ﹐Total Flow-Time and Tardiness important﹒lthough The solutions of general scheduling problem are operations research and Heuristic﹒operations research need longer time for solving﹒Hand scheduling usually have the stress of time﹒There are a large amount of data to deal﹒Although Heuristic couldn’t solve the optimum﹐it can solve approximate optimum﹒It is faster than operations research and acceptable on business﹒So this study utilize Genetic Algorithm(GA)﹒This study is constracting a mathematical model for product scheduling﹒And then testing with actual data to prove the effectiveness about this study﹒The result is optimal﹒It is acceptable about the time of using Genetic Algorithm(GA) to solve﹒This study is testing with data of a company during﹒The testing result about approximate optimum is acceptable﹒It is carrespond to business demand and helpful for real task﹒ Rong-Hwa Huang 黃榮華 2004 學位論文 ; thesis 74 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 輔仁大學 === 應用統計學研究所 === 92 === Manufacturing industry changes from that salesman take the product which has been made to sale to that industry manufacture the product which is needed after market research﹒The faster consumer’s demand varies ﹐the shorter the cycle time of product becomes﹒So the deadline becomes more and more shorter﹒It is important for arrangement of work﹒The way manufacturing industry respond to this condition is changing faster as it can﹒It is not easy to chang﹐especially for order manufacture method and the industry which has complicated process﹒It is important for the type of Printed Circuit Board(PCB) to schedule﹒So this study is about product schedule the purpose of this study is minimization of line mix of total flow-time and tardiness about parallel machine dynamic scheduling﹒The indicators of the problem of product schedule are Total Flow Time﹑Total Tardiness﹑Number Of Tardy Jobs﹑Maximum Tardiness﹑Makespan﹒For Printed Circuit Board(PCB) ﹐Total Flow-Time and Tardiness important﹒lthough
The solutions of general scheduling problem are operations research and Heuristic﹒operations research need longer time for solving﹒Hand scheduling usually have the stress of time﹒There are a large amount of data to deal﹒Although Heuristic couldn’t solve the optimum﹐it can solve approximate optimum﹒It is faster than operations research and acceptable on business﹒So this study utilize Genetic Algorithm(GA)﹒This study is constracting a mathematical model for product scheduling﹒And then testing with actual data to prove the effectiveness about this study﹒The result is optimal﹒It is acceptable about the time of using Genetic Algorithm(GA) to solve﹒This study is testing with data of a company during﹒The testing result about approximate optimum is acceptable﹒It is carrespond to business demand and helpful for real task﹒
|
author2 |
Rong-Hwa Huang |
author_facet |
Rong-Hwa Huang Yeh,Tsai-Jung 葉財榮 |
author |
Yeh,Tsai-Jung 葉財榮 |
spellingShingle |
Yeh,Tsai-Jung 葉財榮 A study on dynamic scheduling of multiobjective parallel machine - Example of Printed Circuit Board |
author_sort |
Yeh,Tsai-Jung |
title |
A study on dynamic scheduling of multiobjective parallel machine - Example of Printed Circuit Board |
title_short |
A study on dynamic scheduling of multiobjective parallel machine - Example of Printed Circuit Board |
title_full |
A study on dynamic scheduling of multiobjective parallel machine - Example of Printed Circuit Board |
title_fullStr |
A study on dynamic scheduling of multiobjective parallel machine - Example of Printed Circuit Board |
title_full_unstemmed |
A study on dynamic scheduling of multiobjective parallel machine - Example of Printed Circuit Board |
title_sort |
study on dynamic scheduling of multiobjective parallel machine - example of printed circuit board |
publishDate |
2004 |
url |
http://ndltd.ncl.edu.tw/handle/30285623657622137058 |
work_keys_str_mv |
AT yehtsaijung astudyondynamicschedulingofmultiobjectiveparallelmachineexampleofprintedcircuitboard AT yècáiróng astudyondynamicschedulingofmultiobjectiveparallelmachineexampleofprintedcircuitboard AT yehtsaijung duōmùbiāopíngxíngjītáizhīdòngtàipáichéngzhīyánjiūyǐyìnshuādiànlùbǎnwèilì AT yècáiróng duōmùbiāopíngxíngjītáizhīdòngtàipáichéngzhīyánjiūyǐyìnshuādiànlùbǎnwèilì AT yehtsaijung studyondynamicschedulingofmultiobjectiveparallelmachineexampleofprintedcircuitboard AT yècáiróng studyondynamicschedulingofmultiobjectiveparallelmachineexampleofprintedcircuitboard |
_version_ |
1718159957416738816 |