雙機流程型生產環境下加權提早與延遲成本最小化之排程問題; Two-Machine Flow Shops Scheduling to Minimize Job Independent Earliness and Tardiness Penalties with a Given Common Due Date

NCUIR > School of Management at National Central University > Graduate Institute of Industrial Management > Electronic Thesis & Dissertation > Item 987654321/11129

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/11129

Title:	雙機流程型生產環境下加權提早與延遲成本最小化之排程問題;Two-Machine Flow Shops Scheduling to Minimize Job Independent Earliness and Tardiness Penalties with a Given Common Due Date
Authors:	徐士凱;Shih-Kai Hsu
Contributors:	工業管理研究所
Keywords:	雙機流程型生產;分支界限法;交期;提早與延遲成本;排程;Two-machine flow shops;Scheduling;Earliness and tardiness penalties;Due date;Branch-and-bound algorithm
Date:	2005-06-30
Issue Date:	2009-09-22 14:14:33 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	本研究探討雙機流程型生產環境下加權提早與延遲成本最小化之排程問題。在這篇論文中，我們假設有多個工作它們有共同的交期要加工，權重是根據這個工作是提早或延遲完工來決定。本論文提出一個分支界限法求得一多產品之加工順序、最小加權提早與延遲成本。而我們也針對提出的分支界限法進行實驗和資料分析，用以驗證演算法的正確性和效率。 This 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.
Appears in Collections:	[Graduate Institute of Industrial Management] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing

Loading...