本課程以介紹排程理論的概念，方法和結果為主要目標，希望提供給大學部高年級對構建現代排程應用程序的知識庫感興趣的學生所學習的課程。 學生可以不具備排程的背景，對隨機排程主題並不熟悉，或僅具備基本的機率概念者所設計的。 所以本課程將提供實現該類中描述的一些解決方案的概念合計算法，還將涵蓋使用電子表格模型來計算排程計畫問題的解決方案。 尤其是在解決隨機排程問題時，學生必須在對易處理性和現實性的需求之間取得平衡。 因此，當優化方法和分析工具不足時，本課程將強調啟發式和系統模擬的方法的應用。 除此之外，本課程還將為學生提供許多排程的範例以及計算練習題，以協助同學們對本課程內容的學習。

This course aims to introduce the concepts, methods and results of scheduling theory. It hopes to provide courses learned by senior students interested in the knowledge database of modern scheduling applications in the university. Students may not have a scheduling background, are unfamiliar with the theme of random scheduling, or are designed by those who have only basic chance concepts. Therefore, this course will provide a conceptual combined algorithm for some of the solutions described in this category, and will also cover solutions to calculating scheduling problems using electronic table models. Especially when solving random scheduling problems, students must strike a balance between easy-to-handle and realistic needs. Therefore, when optimization methods and analysis tools are insufficient, this course will emphasize the application of the development and system simulation methods. In addition, this course will provide students with many scheduling examples and calculation training questions to help students learn about the content of this course.

Kenneth R. Baker and Dan Trietsch, "PRINCIPLES OF SEQUENCING AND SCHEDULING," A JOHN WILEY & SONS, INC. PUBLICATION, 2009, ISBN 978-0-470-39165-5.

Kenneth R. Baker and Dan Trietsch, "PRINCIPLES OF SEQUENCING AND SCHEDULING," A JOHN WILEY & SONS, INC. PUBLICATION, 2009, ISBN 978-0-470-39165-5.