查詢結果分析
相關文獻
- Single Machine Scheduling with Due Dates and Class Setups
- 以最大延遲時間為準則之單機群組排程問題
- Two- and Three-Machine Flowshop Scheduling Problems with Optional Final Operation
- 零工型工廠以工作為導向的啟發式排程系統之構建
- Bicriteria Dynamic Scheduling in Multi-Machine Flowshop
- 人機互動式排程系統之研究
- 自我調適的動態排程系統--限制排程、模糊理論和遺傳演算法的應用
- 深入淺出話核心
- 多重供應點的生產排程與運輸分配問題
- 預防保養排程之方法
頁籤選單縮合
題 名 | Single Machine Scheduling with Due Dates and Class Setups=考慮到期日的工件分類單機排程研究 |
---|---|
作 者 | 潘昭賢; 蘇啟祥; | 書刊名 | 中國工程學刊 |
卷 期 | 20:5 1997.09[民86.09] |
頁 次 | 頁561-572 |
分類號 | 494.542 |
關鍵詞 | 排程; 單一機器; 組別設置時間; 最大延遲時間; Scheduling; Single machine; Class setup time; Maximum lateness; |
語 文 | 英文(English) |
中文摘要 | 在基本的排程問題中,通常是假設機器的設置時間是固定不變的;因此將設置時間 包含在工件的處理時間內,一併考慮。然而,在一般的生產環境中,設置時間並非固定的,而 是需要額外考慮的因素。本文探討工件分類的單機排程問題。在工件分類的問題中,機器在 處理不同類的工件間需要有設置時間;而每類工件有固定的設置時間。本文提出基本性質以簡 化問題,並利用凌越法則和下界值,發展分枝界限法,以求得工件分類的單機延遲時間最小 化的最佳排程。 |
英文摘要 | Standard scheduling problems bear the assumption that each job has a constant setup time and thus this setup time can be included in the processing time of a job. However, many realistic production systems suggest otherwise. This paper considers a single machine scheduling problem where jobs are classified into classes and a setup is required between jobs of different classes, but not between jobs of the same class. This class setup time depends only on the current job, not on the previous job. The performance measure is the maximum lateness of jobs. Several properties of the optimal solution and a lower bound of the optimal lateness are developed to construct a branch-and-bound algorithm in the search of an optimal schedule and the effectiveness of the proposed algorithm is empirically evaluated. |
本系統中英文摘要資訊取自各篇刊載內容。