查詢結果分析
來源資料
相關文獻
- Single-Machine Scheduling with Past-Sequence-Dependent Delivery Times and Learning Effect
- Parallel-Machine Scheduling with Setup and Removal Times Under Consideration of the Learning Effect
- Single-Machine Scheduling with Joint Deterioration and Learning Effects Under Group Technology and Group Availability Assumptions
- 零工型工廠以工作為導向的啟發式排程系統之構建
- Comment on Machine Scheduling Problem to Minimize the Earliness/Tardiness Costs with Learning Effect and Deteriorating Jobs
- Bicriteria Dynamic Scheduling in Multi-Machine Flowshop
- 人機互動式排程系統之研究
- 自我調適的動態排程系統--限制排程、模糊理論和遺傳演算法的應用
- 深入淺出話核心
- 多重供應點的生產排程與運輸分配問題
頁籤選單縮合
題 名 | Single-Machine Scheduling with Past-Sequence-Dependent Delivery Times and Learning Effect=具過去工作順序相依之交傳送時間與學習效應之單機生產排程研究 |
---|---|
作 者 | 楊肅正; 許洲榮; 張庭瑞; 楊達立; | 書刊名 | 工業工程學刊 |
卷 期 | 28:4 2011.06[民100.06] |
頁 次 | 頁247-255 |
分類號 | 494.5 |
關鍵詞 | 排程; 過去工作順序相依; 傳送時間; 學習效應; Scheduling; Past-sequence-dependent; Delivery time; Learning effect; |
語 文 | 英文(English) |
英文摘要 | In this study we consider single-machine scheduling problems with past-sequence-dependent (p-s-d) delivery times and a learning effect. The objectives are to minimize the makespan, the total completion time, the total weighted completion time, the total waiting time, and the total weighted waiting time. We show that the makespan, the total completion time, and the total waiting time minimization problems can be optimally solved in polynomial time algorithms. For the total weighted completion time and the total weighted waiting time minimization problems, we prove that they remain polynomially solvable with certain conditions. Furthermore, we analyze the worst-case bounds for the total weighted completion time and the total weighted waiting time minimization problems and propose two heuristic algorithms to find near optimal solutions. Our numerical results indicate that the two heuristic algorithms are efficient and effective in obtaining near optimal solutions for both problems. |
本系統中英文摘要資訊取自各篇刊載內容。