參考文獻 |
1.王勇華,「人員排班問題啟發式解法之應用」,交通大學土木工程研究所碩士論文,1993。
2.杜宇平,「空服員排班網路模式之研究」,中央大學土木工程研究所博士論文,2000。
3 .李宇欣、楊承道,「雙勤務人員排班問題」,運輸計劃季刊,第28卷,第3期,第409-420頁,1999。
4 .李治綱、陳朝輝、郭彥秀,「台鐵司機員排班與輪班問題之研究」,中華民國第五屆運輸網路研討會論文集,第177-187頁,2000。
5 .連志平,「警察人員排班問題之研究」,交通大學土木工程研究所碩士論文,1998。
6 .陳春益、李宇欣與盧華安,「飛機調度與定期維修整合模式之研究」,運輸計劃季刊,第二十六卷,第一期,第69-94頁,1997。
7 .顏上堯、林錦翌,「空服員排班組合最佳化之研究」,中國土木水利工程學刊,第九卷,第二期,第303-314頁,1997。
8 .顏上堯、羅智騰,「因應預期性航具維修之系統性飛航排程」,中國土木水利工程學刊,第八卷,第三期,第447-456頁,1996。
9 .顏上堯、翁綵穗,「季節轉換間緩衝期飛航排程之研究」,運輸計劃季刊,2000。(已接受)
10.蘇昭銘、張靖,「捷運系統站務人員排班模式之研究」,中華民國運輸學會第十三屆論文研討會論文集,第613-622頁,1998。
11.Alfares, H. K., “An Efficient Two-Phase Algorithm For Cyclic Days-Off Scheduling,” Computers Operational Research, Vol. 25, No.11, pp.913-923, 1998.
12. Aykin, T., “A Comparative Evaluation of Modeling Approaches to the Labor Shift Scheduling Problem,” European Journal of Operational Research, Vol.25, pp.381-397, 2000.
13. Bartholdi, J. J., “A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering,” Operations Research, Vol.29, pp.501-510, 1981.
14. Beasley, J. E., and Cao, B., “A Tree Search Algorithm for the Crew Scheduling Problem,” European Journal of Operational Research, Vol. 94, No. 3, pp. 517-526, 1996.
15. Beaumont, N., “Scheduling Staff using Mixed Integer Programming,” European Journal of Operational Research, Vol. 98, pp.473-484, 1997.
16. Bechtold, S. E., Brusco, M. J., and Showalter, M. J., “A Comparative Evaluation of Labor Tour Scheduling Method,” Decision Sciences, Vol. 22, pp.683-699, 1991.
17. Brusco, M. J., “Solving Personnel Tour Scheduling Problems Using the Dual All-integer Cutting plane,” IIE Transaction, Vol. 30, pp.835-844, 1998.
18. Brusco, M. J., and Jacobs, L. W., “Elimination Redundant Columns in Continuous Tour Scheduling Problems,” European Journal of Operational Research, Vol. 111, pp. 518-525,1998.
19. Brusco, M. J., and Johns, T. R., “A Sequential Integer Programming Method for Discontinuous Labor Tour Scheduling,” European Journal of Operational Research, Vol. 95, pp.537-548, 1996.
20. Brusco, M. J., and Johns, T. R., “Improving the Dispersion of Surplus Labor in Personnel Scheduling Solutions,” Computers and Industrial Engineering, Vol. 28, No. 4, pp. 745-754, 1998.
21. Caprera, A., Fischetti, M., Toth, P., Vigo, D., and Guida, P. L., “Algorithms for Railway Crew Management,” Mathematical Programming, Vol. 79, pp.125-141, 1997.
22. Easton, F. F., and Rossin, D. F., “Equivalent Alternate Solutions for the Tour Scheduling Problem,” Decision Sciences, Vol. 22, pp. 985-1007, 1991.
23. Higgins, A., “Scheduling of Railway Track Maintenance Activities and Crews,” Journal of the Operational Research Society, Vol. 49, pp.1026-1033, 1998.
24. Hoong, C. L., “On the Complexity of Manpower Shift Scheduling,” Computers and Industrial Engineering, Vol. 23, No. 1, pp. 93-102, 1996.
25. Langerman, J. J., and Ehlers, E. M., “Agent — Based Airline Scheduling,” Computers and Industrial Engineering, Vol. 33, No.3-4, pp. 849-852, 1997.
26. Morris, J. G., and Showalter, M. J., “Simple Approaches to Shift, Days-Off and Tour Scheduling Problems,” Management Science, Vol. 29, No. 8, pp. 942-950, 1983.
27. Narasimhan, R., “An Algorithm for Single Shift Scheduling of Hierarchical Workface,” European Journal of Operational Research, Vol. 96, pp.113-121, 1996.
28. Lucic, P., and Teodorovic, D., “A Fuzzy Set Theory Approach to the Aircrew Rostering Problem,” Fuzzy Set and System, Vol.95, pp. 261-271, 1998.
29.Lucic, P., and Teodorovic, D., “Simulated Annealing for the MultiObjective Aircrew Rostering Problem,” Transportation Research A, Vol. 33, pp. 19-45, 1999.
30. Ryan, D. M., “The Solution of Massive Generalized Set Partitioning Problem in Aircrew Rostering,” Journal of the Operational Research Society. Vol. 43, pp. 459-467, 1992.
31. Yan, S., and Chang, J. C., “Airline Cockpit Crew Scheduling,” European Journal of Operational Research, 2000.(accepted)
32. Yan, S., Tang, T. T., and Tu, Y. P., “Optimal Construction of Airline Individual Crew Pairings,” Computers and Operations Research, 2000. (accepted) |