完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | 林慈盈 | en_US |
dc.contributor.author | Lin, Cih-Ying | en_US |
dc.contributor.author | 巫木誠 | en_US |
dc.contributor.author | Wu, Muh-Cherng | en_US |
dc.date.accessioned | 2014-12-12T01:31:47Z | - |
dc.date.available | 2014-12-12T01:31:47Z | - |
dc.date.issued | 2008 | en_US |
dc.identifier.uri | http://140.113.39.130/cdrfb3/record/nctu/#GT079633533 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/42888 | - |
dc.description.abstract | 本研究探討考慮跨廠與整備時間的雙流線型工廠排程問題。此排程之研究目標為最小化寬裕時間之變異係數,寬裕時間即為交期與完工時間之間的差距。於此問題中,我們將需要相同整備治具的工件集合稱之為工件族。大多數以往的文獻中,不是使用family-based(將全部皆為同ㄧ家族的工件視為單一工件做排程),就是使用individual-based(每個工件排程是獨立地,而不考慮加入相同工件族)。本研究提出了group-based的方法(亦即將一個工件族區分成多個工件集合,排程中將每個工作集合當作單一個體)。此三個以基因演算法為基礎的GA-EDD-Family、GA-EDD-Group及GA-EDD-Individual方法被發展以及經由多種實驗做比較。實驗結果指出GA-EDD-Group的方法在多數情境下勝過於其他兩種方法。 | zh_TW |
dc.description.abstract | This research examines a dual flow shop scheduling problem, which is in the context of considering cross-plant processing and setup times. The scheduling objective is to minimize coefficient of variation of slack times, in which the slack time of a job denotes the difference between the due date and its total processing time. Herein, a set of jobs that need the same setup is called a job family. Most prior literature either used a family-based approach (all jobs of a particular family are scheduled as a single job) or used an individual-based approach (each job is independently scheduled without considering its affiliation to its job family). This research proposes a group-based approach (that is, dividing a job family into several job groups, and scheduling each job group as a single entity). Several genetic algorithms (GAs), which are of GA-EDD-Family, GA-EDD-Group, or GA-EDD-Individual, have been developed and compared by numerical experiments. Experiment results indicate that the group-based approach outperforms the other two approaches in most scenarios. | en_US |
dc.language.iso | zh_TW | en_US |
dc.subject | 排程 | zh_TW |
dc.subject | 跨廠 | zh_TW |
dc.subject | 雙流線型生產 | zh_TW |
dc.subject | 工件族 | zh_TW |
dc.subject | 整備時間 | zh_TW |
dc.subject | 交期 | zh_TW |
dc.subject | 基因演算法 | zh_TW |
dc.subject | scheduling | en_US |
dc.subject | cross-plant | en_US |
dc.subject | dual flow shop | en_US |
dc.subject | family | en_US |
dc.subject | setup time | en_US |
dc.subject | due date | en_US |
dc.subject | genetic algorithm(GA) | en_US |
dc.title | 考慮工件族整備時間之雙流線型工廠排程 | zh_TW |
dc.title | Dual Flow Shops Scheduling with Family Setup Times | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | 工業工程與管理學系 | zh_TW |
顯示於類別: | 畢業論文 |