排程數據之分析

Data Analysis of a Schedule

10.6338/JDA.200806_3(3).0004

許天淳(Tien-Chun Hsu)

排程 ； 排程穩健度效率 ； 排程作業寬裕 ； 排程目標衡量 ； Scheduling ； Robustness Efficiency ； Operation Float ； Performance Measure

Journal of Data Analysis

3卷3期（2008 / 06 / 01）

47 - 62

繁體中文

所謂排程乃是如何有效地分配有限資源給予待處理工作的一種方法，排程方法在近三、四十年來已發展得相當豐碩。傳統排程之作法，重點在於發展出排程方法，針對既定排程目標衡量下，得到最佳或接近最佳之排程，然而，排程排出來後終要執行，因此排程相關性質為何為一重要課題，本文針對已排好的排程數據（各機器上所有作業加工開始時間和加工完成時間），提出一系列數據分析，此分析包含排程目標衡量分析、排程寬裕分析、排程穩健度效率分析等，可提供作為管理決策和排程後續執行步驟之依據。因此排程方法不應再只追求如何得到好的排程目標衡量值為滿足，而是得進一步考慮如何減少排程寬裕之損失下增加排程作業寬裕，應兼顧排程目標衡量與排程穩健度為新的目標。

Scheduling can be stated as a methodology of allocating limited resources to a collection of jobs for a performance measure. Scheduling approaches have been well developed in the last decade. The literature focuses on the development of scheduling approaches to derive an optimal or near-to-optimal schedule for a given performance measure. However, once the schedule is accepted, it will be put into practice in the shop floor. Thus, deriving characteristics of the accepted schedule is an important subject. For this, in this paper, we assume that the data of the planned end time and planned start time for each operation in a schedule is known and derive three types of information: (1) the performance measure analysis, (2) operation float analysis and (3) the robustness efficiency analysis. The result of the analysis can be used for the successive decision for management. Thus, it is not enough for a scheduling approach to consider only the traditional performance measure. A scheduling approach should further consider the new performance measures of the operation float and the robustness efficiency.

1. Fogarty, D. W.,Blackstone, J. H.,Hoffmann, T. R.(1991).Production and Inventory Management.South-Western.
2. French, S(1982).Sequencing and Scheduling: an Introduction to the Mathematics of the Job-shop.New York.:John Wiley & Sons, Inc..
3. Goldratt, E.M.(1990).The Haystack Syndrome.New York:North River Press.
4. Grabot, B.,Geneste, L.(1994).Dispatching rules in scheduling : a fuzzy approach.International Journal of Production Research,32(4),903-915.
5. Graves, S.C.(1981).A review of production scheduling.Operations Research,29,646-675.
6. Hsu, T.-C.(2003).New expression of scheduling performance measures.International Journal of Production Research,44(15),3147-3158.
7. Kusiak, A.,Chen, M.(1988).Expert systems for planning and scheduling manufacturing systems.European Journal of Operational Research,34(2),113-130.
8. Lawton, G.(1992).Genetic algorithms for schedule optimization.AI Expert
9. Leon, V. J.,Wu, S. D.,Storer, R. H.(1994).Robustness measures and robust scheduling for job shops.IIE Transactions,26,32-43.
10. Pinedo, M.,Chao, X.(1999).Operations scheduling with applications in manufacturing and services.McGraw Hill..
11. Solberg, J.J.(1989).Production planning and scheduling in CIM.Information Processing,89,919-925.
12. Wacker, J. G.,Lucht, D. M.(1985).Effective dispatching rules to improve performance in job shops.Production and Inventory Management,26(3),77-87.

1. 張彥文(2017)。以即時資料為基礎的作業現場製程規劃與彈性管控系統。中原大學資訊管理學系學位論文。2017。1-79。