博碩士論文 92426005 完整後設資料紀錄

DC 欄位 語言
DC.contributor工業管理研究所zh_TW
DC.creator徐士凱zh_TW
DC.creatorShih-Kai Hsuen_US
dc.date.accessioned2005-7-3T07:39:07Z
dc.date.available2005-7-3T07:39:07Z
dc.date.issued2005
dc.identifier.urihttp://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=92426005
dc.contributor.department工業管理研究所zh_TW
DC.description國立中央大學zh_TW
DC.descriptionNational Central Universityen_US
dc.description.abstract本研究探討雙機流程型生產環境下加權提早與延遲成本最小化之排程問題。在這篇論文中,我們假設有多個工作它們有共同的交期要加工,權重是根據這個工作是提早或延遲完工來決定。本論文提出一個分支界限法求得一多產品之加工順序、最小加權提早與延遲成本。而我們也針對提出的分支界限法進行實驗和資料分析,用以驗證演算法的正確性和效率。zh_TW
dc.description.abstractThis study deals with the two-machine flow shops scheduling problem with the consideration of earliness and tardiness penalties. There are multiple jobs with a given common due date to be scheduled. All jobs have equal earliness and tardiness weights, and the weight of a job depends on whether the job is early or late, which are job-independent. The objective is to find a schedule that minimizes the weighted sum of earliness and tardiness penalties. We propose a number of propositions and revised Bagchi’s algorithm as a lower bound, which are implemented in our branch-and-bound algorithm to eliminate nodes efficiently in the branching tree. We also conduct computational analysis to show the validation and the effectiveness of our algorithm compared with enumeration.en_US
DC.subject雙機流程型生產zh_TW
DC.subject分支界限法zh_TW
DC.subject交期zh_TW
DC.subject提早與延遲成本zh_TW
DC.subject排程zh_TW
DC.subjectTwo-machine flow shopsen_US
DC.subjectSchedulingen_US
DC.subjectEarliness and tardiness penaltiesen_US
DC.subjectDue dateen_US
DC.subjectBranch-and-bound algorithmen_US
DC.title雙機流程型生產環境下加權提早與延遲成本最小化之排程問題zh_TW
dc.language.isozh-TWzh-TW
DC.titleTwo-Machine Flow Shops Scheduling to Minimize Job Independent Earliness and Tardiness Penalties with a Given Common Due Dateen_US
DC.type博碩士論文zh_TW
DC.typethesisen_US
DC.publisherNational Central Universityen_US

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明