查詢結果分析
相關文獻
- Scheduling with Multiple Common Due Windows Assignment and General Position-Dependent and Resource-Dependent Processing Times
- 以彩色時間性物件導向裴氏圖為基礎之自動化製造系統排程方法
- 碼頭原料卸船作業整體規劃
- 應用基因演算法於運鈔車護運作業排程規劃
- 彈性製造系統之「可替代途程派工法則」與「刀具配置」研究
- A Study of Operating Room Scheduling that Integrates Multiple Quantitative and Qualitative Objectives
頁籤選單縮合
| 題 名 | Scheduling with Multiple Common Due Windows Assignment and General Position-Dependent and Resource-Dependent Processing Times=同時考慮具一般性位置相依與資源相依作業時間之多交貨時窗排程 |
|---|---|
| 作 者 | 楊肅正; 賴建榮; | 書刊名 | International Journal of Information and Management Sciences |
| 卷 期 | 25:2 2014.06[民103.06] |
| 頁 次 | 頁101-120+a7 |
| 分類號 | 494.578 |
| 關鍵詞 | 作業排程; 多交貨時窗指派; 位置相依作業時間; 資源相依作業時間; Scheduling; Multiple common due windows assignment; Position-dependent processing time; Resource-dependent processing time; |
| 語 文 | 英文(English) |
| 英文摘要 | In this paper we consider multiple common due windows assignment and single-machine scheduling problems with general position-dependent and resource-dependent processing times simultaneously. Multiple common due windows, an extension of single common due window, allow a job to fit one from multiple common due windows. We assume that the number of common due windows to be assigned to the jobs is given. Two resource allocation models are examined, namely the linear resource consumption model and the convex re-source consumption model. The actual processing time of a job is a function of its scheduled position in a sequence and its resource allocation. We aim to determine jointly the optimal common due window positions and sizes, the set of jobs assigned to each common due window, the optimal resource allocations, and the optimal schedule for minimizing an objective function which includes earliness, tardiness, common due windows assignment, makespan, and resource consumption costs. We provide some properties of the optimal schedule for the problem and propose polynomial time algorithms for all the problems considered. |
本系統中英文摘要資訊取自各篇刊載內容。