排程（scheduling）在生產管理中是一個非常重要的領域，主要是探討如何將製造資源（機台、設備、人力）妥善地分配給一群待處理的工件，以達到最大的目標效益。在工單式生產系統排程（job shop）中，有不同類型的機台，系統內要完成的工件，在這些機台上都有其特定的加工流程，工單式生產系統排程主要是在符合工件加工流程的條件下，指派工件在特定的時間區段於所需的機台上加工。本研究在有工單式生產系統排程的情況下，加入時窗限制（due window）與任意多變的釋放時間（release date）兩項限制。一般而言，在相關供應鏈的體系中，顧客與廠商都希望能夠在約定的期間內完成交易，否則會發生延遲交付，產生懲罰的效應，如此便衍生出時窗限制（time window）的問題；產品未被放入排程計劃前，若仍未在指定時間完成準備動作，則延遲情況同樣會發生，所以便衍生出任意多變的釋放時間（arbitrary release date）的問題，其目標為求出符合交易完成時窗內之所有工件的完工時間（makespan），以求得庫存與延遲成本之最小化。本研究先對於具有時窗限制與任意多變的釋放時間的問題運用在工單式生產系統排程進行數學模式的建構，之後再收集工單式生產系統排程作業處理的數據，先利用套裝軟體LINGO 7.0求解工單式生產系統排程之小規模最佳解，並與模擬退火法中三種鄰近解產生機制比較解答品質，大規模問題則利用模擬退火法中三種鄰近解產生機制求解出近似最佳解與求解時間，並做求解時間與解答品質之比較，以找出較為適當之鄰近解產生機制。由例題分析之結果可知，其解答品質以鄰近解產生機制SA2為最佳，SA1較不穩定；求解時間而言，三種鄰近解產生機制之間的比較，則以SA2之求解時間較其他兩種鄰近解產生機制為短。

中文部分

田長模，生產系統與管理，永大書局有限公司，民國73年。
吳貴彬，以模擬退火法求解工單式生產系統之排程問題-最小化總遲延時間，國立成功大學工業管理研究所博士論文，民國87年。
林恆貞，重覆性製造系統排程效率之比較—以no-wait Problem為例，國立成功大學工業管理研究所碩士論文，民國87年。
許丕敏，工單式生產系統排程績效之比較─最小化總遲延時間，國立成功大學工業管理研究所碩士論文，民國88年。
許淑芬，具等候時間窗口限制之零工式生產排程問題，國立中央大學工業管理研究所碩士論文，民國87年。
韓俊逸，基因演算法解算交期限制零工型排程問題之效果分析，私立元智大學工業管理研究所碩士論文，民國91年。

英文部分

Adams, J., Balas, E., and Zawack, D. The shifting bottleneck procedure for job shop scheduling. Management Science, Vol. 34, No. 3, pp. 391-401, 1988.
Arts, E. H. L. and Korst, J. Simulated Annealing and Boltzmann Machines. John Wiley & Sons, 1989.
Baker, K. R. and Scudder, G. D. Sequencing with earliness and tardiness penalties： a review. Operations Research, Vol. 38, pp. 22-57, 1990.
Chen, Z. L. and Lee, C. Y. Parallel machine scheduling with a common due window. European Journal of Operational Research, Vol. 136, pp. 512-527, 2002.
Cheng, T. C. E. and Ding, Q. The complexity of scheduling starting time dependent tasks with release times. Information Processing Letters, Vol. 65, pp. 75-79, 1998.
Chiu, H. N. A cost saving technique for solving capacitated multi-stage lot-sizing problems. Computers & Industrial Engineering, Vol. 24, No. 3, pp. 367-378, 1993.
Desrosiers, J., Soumis, F., Desrochers, M. and Sauve, M. Methods for routing with time windows. European Journal of Operational Research, Vol. 23, pp. 236-245, 1986.
Du, D. Z. and Pardalos, P. M. Handbook of Combinatorial Optimization, Vol. 1. Kluwer Academic Publishers, 1998.
Garey, M. R., Johnson, D. S., and Sethi, R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, Vol. 1, No. 2, 1976.
Gonzalez, T. and Sahni, S. Flowshop and Jobshop Schedules： complexity and Approximation. Operations Research, Vol. 26, No. 1, pp. 36-52, 1978.
He, Z., Yang, T. and Deal, D. E. Multiple-pass heuristic rule for job shop scheduling with due dates. International Journal of Production Research, Vol. 31, No. 11, pp. 2677-2692, 1993.
Heragu, S. S. and Alfa, A. S. Experimental analysis of simulated annealing based algorithms for the layout problem. European Journal of Operational Research, Vol. 30, No. 1, pp. 95-108, 1992.
Jajodia, S., Minis, I., Harhalakis, G. and Proth, J. M. Class：computerized layout solutions using simulated annealing. International Journal of Production Research, Vol. 30, No. 1, pp. 95-108, 1992.
Johnson, D. S., Aragon C. R., Lyle A. M. and Catherine S. Optimization by simulated annealing：an experimental evaluation； Part 1. Graph Partitioning, Vol. 37, No. 6, pp. 865-892, 1989.
Kim, J. U. and Kim, Y. D. Simulated annealing and genetic algorithms for scheduling products with multi-level product structure. Computers & Operations Research, Vol. 23, No. 9, pp. 857-868, 1996.
Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P. Optimization by simulated annealing. Science, Vol. 220, pp. 671-680, 1983.
Kouvelis, P. and Chiang, W. C. A simulated annealing procedure for single row layout problems in flexible manufacturing systems. International Journal of Production Research, Vol. 30, No. 4, pp. 717-732, 1992.
Lambrecht, M. R., Ivens, P. L. and Vandaele, N. J. Aclips： a capacity and lead time integrated procedure for scheduling. Management Science, Vol. 44, No. 11, Part 1 of 2, pp. 1548-1561, 1998.
Liman, S. D., Ramaswamy, S. S. and Thongmee, S. Determination of common due window location in a single machine scheduling problem. European Journal of Operational Research, Vol. 93, pp. 68-74, 1996.
Lourenco, H. R. Job-shop scheduling：computational study of local search and large-step optimization method. European Journal of Operational Research, Vol. 83, No. 2, pp. 347-364, 1995.
Naroska, E. and Schwiegelshohn, U. On an on-line scheduling problem for parallel jobs. Information Processing Letters, Vol. 81, pp. 297-304, 2001.
Pinedo, M. Scheduling Theory, Algorithms, and Systems. Prentice Hall, 1995.
Rutenbar, R. A. Simulated annealing algorithms： an overview. IEEE Circuits And Devices Magazine, pp. 19-26, 1989.
Sabuncuoglu, I. and Lejmi, T. Scheduling for non regular performance measure under the due window approach. Omega, The International Journal of Management Science, Vol. 27, pp. 555-568, 1999.
Schutten, J. M. J. Practical job shop scheduling. Annals of Operations Research, Vol. 83, pp. 161-177, 1998.
Singer, M. Decomposition methods for large job shops. Computers & Operations Research, Vol. 28, pp. 193-207, 2001.
Sotskov, Y. N., Tautenhahn, T. and Werner, F. On the application of insertion techniques for job shop problems with setup times. RAIRO Rech. Op'er, Vol. 33, No. 2, pp. 209-245, 1999.
Sridhar, J. and Rajendran, C. Scheduling in a cellular manufacturing system： a simulated annealing approach. International Journal of Production Research, Vol. 31, No. 12, pp. 2927-2945, 1993.
Sule, D. R. Industrial Scheduling. Pws Publishing Company, 1997.
Sun, D. and Lin, L. A dynamic job shop scheduling framework： a backward approach. International Journal of Production Research, Vol. 32, pp. 967-985, 1994.
Van Laarhoven, P. J. M. and Arts, E. H. L., Simulated Annealing： Theory and Applications. Kluwer Academic Publishers, 1988.
Van Laarhoven, P. J. M., Arts, E. H. L. and Lenstra, J. K. Job shop scheduling by simulated annealing. Operational Research, Vol. 40, pp. 113-125, 1992.
Werner, F. On the heuristic solution of the permutation flow shop problem by path algorithms. Computers & Operations Research, Vol. 20, No. 7, pp. 707-722, 1993.