排程寬裕之導出與應用

摘要

排程方法在過去三十年中發展得相當成熟，但是費盡苦心地去選取並執行某一排程方法而得出的排程，若沒有被執行完成，一切的努力仍為白費。然而執行排程的工廠環境卻是動態的，因此面對多變的工廠環境，如何順利地執行排程是很重要的課題，這課題包含：(1)如何構建出一個穩健的排程；(2)如何按照各作業將危害排程圓滿執行之程度，建立生產控制之優先次序；(3)如何決定要被壓縮之排程作業，以解決工件將要延遲完工之危機。本文提出排程寬裕的觀念和導出方法，並以此為基礎，分別對上述三個課題提出解法。

Abstract

Many scheduling approaches for generating effective schedules have been developed. However, if all the tasks of the resultant schedule can not be finished at the production control stage within the planning period, all the efforts of these are useless. Unfortunately, the management have to face unexpected disruptions in the shop when implementing a schedule. Thus, there exist three problems to be addressed: (1) how to construct a robust schedule; (2) how to derive the control priority order for each operation in the schedule, according to the extent of being deviated from the schedule; and (3) how to choose the operations for compression in order to force the orders which will be delayed to be on schedule again. This paper presents the concept and the derivation of the float time for each operation in a schedule. By using the float times as measures, the approaches for solving the above problems are developed.

關鍵詞:

• 排程
• 排程寬裕
• 穩健的排程
• 作業壓縮

Key Words:

• scheduling
• float time
• robust schedule
• operation compression