查詢結果分析
來源資料
相關文獻
- Single-Machine Scheduling with Decreasing Time-Dependent Processing Times to Minimize Total Absolute differences in waiting times
- 單機排程求最小遲誤之「兩比算法式」及其在軍事生產作業上之適用範疇
- Minimizing the Makespan in a Single Machine Scheduling Problem with a Flexible Maintenance
- Single Machine Scheduling Problem with Fuzzy Due Date and Processing Time
- 單機生產型態排程方法之研究
- 三角模糊數在單機排程的應用
- 以模擬退火法求解具有一般化提前完成與工作延遲懲罰成本之共同到期日單機排程問題
- 動態規劃法在單機排程中之應用
- On Single-Machine Scheduling with Release Times to Minimize Total Weighted Completion Time
- A Two-Dhase Approach for Single Machine Scheduling Problems: Minimizing the Total Absolute Deviatiun
頁籤選單縮合
題名 | Single-Machine Scheduling with Decreasing Time-Dependent Processing Times to Minimize Total Absolute differences in waiting times=極小化等待時間總絕對差和加工時間隨開工時間遞減的單機排程問題之研究 |
---|---|
作者 | 王丹; 吳玉斌; 王吉波; 季平; Wang, Dan; Wu, Yu-bin; Wang, Ji-bo; Ji, Ping; |
期刊 | 工業工程學刊 |
出版日期 | 20121000 |
卷期 | 29:7 2012.10[民101.10] |
頁次 | 頁444-453 |
分類號 | 494.5 |
語文 | eng |
關鍵詞 | 排程; 單機; 和開工時間有關的加工時間; 等待時間總絕對差; |
英文摘要 | In this article we consider a single-machine scheduling problem with decreasing time-dependent jobprocessing times. Decreasing time-dependent job-processing times means that its processing time is a non-increasing function of its execution start time. The objective is to find a schedule that minimizes total absolute differences in waiting times. We show that the optimal schedule is V-shaped: jobs are arranged in the descending order of their normal processing times if they are placed before the job with the smallest normal processing time, but in the ascending order of their normal processing times if placed after it. We prove several other properties of an optimal schedule, and introduce two heuristic algorithms that are tested against a lower bound. We also provide computational results to evaluate the performance of the heuristic algorithms. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。