查詢結果分析
來源資料
相關文獻
- 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
- 考慮單元負荷與機器途程的製造單元分群研究
- 有關流程型工廠群組排程利用分枝界限法求解之探討
- Parallel Machines Scheduling with Deterioration Effects and Resource Allocations
- Parallel-Machine Scheduling with Setup and Removal Times Under Consideration of the Learning Effect
- Single-Machine Scheduling with Past-Sequence-Dependent Delivery Times and Learning Effect
- Parallel Machines Scheduling with Simultaneous Considerations of Position-Dependent Deterioration Effects and Maintenance Activities
- 零工型工廠以工作為導向的啟發式排程系統之構建
- Scheduling Due Dates Assignment with Simultaneous Considerations of Time-Dependent and Position-Dependent Deterioration Effects and Deteriorating Maintenance on a Single Machine
頁籤選單縮合
題 名 | Single-Machine Scheduling with Joint Deterioration and Learning Effects Under Group Technology and Group Availability Assumptions=同時具工作退化與學習效應及群組技術與群組可用性之單機生產排程研究 |
---|---|
作 者 | 楊肅正; 楊達立; 張庭瑞; | 書刊名 | 工業工程學刊 |
卷 期 | 28:8 2011.12[民100.12] |
頁 次 | 頁597-605 |
分類號 | 494.5 |
關鍵詞 | 排程; 群組技術; 群組可用性; 學習效應; 退化效應; Scheduling; Group technology; Group availability; Learning effect; Deterioration effect; |
語 文 | 英文(English) |
英文摘要 | The goal of group technology in manufacturing process is to identify a set of products with similar processing requirements and minimize machine changeover and setup. Although different models of joint deterioration and learning effects have been extensively studied in various areas, it has rarely been studied in the context of group scheduling. In this article, we consider single-machine scheduling problems involving deterioration and learning effects simultaneously under the group technology and the group availability assumptions. We assume that the group setup time is a function of position-dependent learning while the actual processing time of a job is a function of joint time-dependent deterioration and position-dependent learning. We further assume that after the setup, the machine deterioration will reset first and then starts anew. We prove that the makespan and the total completion time minimization problems can be optimally solved in polynomial time algorithms with agreeable conditions. |
本系統中英文摘要資訊取自各篇刊載內容。