四、 實例展示
5.2. 未來研究方向
1. 未來電信系統故障派工可透過 M 化派工平台及 LBS (Location Based Service) 定位技術，配合企業內部系統執行調派人員、料件與車輛，聰明調度資源，讓 外勤人員及時掌握所需資訊與事件的地理位置。
2. 應用到警政、消防等領域:大型災害發生後常伴隨著維修人員與資源短缺的情形
發生。如何有系統的做資源分配與規劃救災路線就十分重要。
44
參考文獻或資料
〔1〕Task assignment with multiskilled employees and multiple modes for product development projects, ,International Journal Of Advanced Manufacturing
Technology Volume: 61 Issue: 1-4 Pages: 391-403 DOI:
10.1007/s00170-011-3686-7 Published: JUL 2012
〔2〕Xu, Q. and K.E. Xi-Zheng, 2009. Models and genetic algorithm for designated-points shortest path problem. Syst. Eng. Electron., 31: 459-462.
〔3〕 G.J. Hwang, S.S. Tseng, “A heuristic task assignment algorithm to maximize reliability of adistributed system,” IEEE Transactions on Reliability, vol R-42, 1993 Sep, pp 408-415.
〔4〕Chin-Ching Chiu, Chung-Hsien Hsu, Yi-Shiung Yeh, "A genetic algorithm for reliability-oriented task assignment with k˜ duplications in distributed systems", Reliability IEEE Transactions on, On page(s): 105 - 117 Volume: 55, Issue: 1, March 2006
〔5〕M. Kafil, I. Ahmad, Optimal task assignment in heterogeneous distributed computingsystems, IEEE Concurrency 6: 42-52, 1998.
〔6〕A. Ernst, H. Jiang, M. Krishnamoorthy, Mathematical programming approaches forsolving task allocation problems, Proc. of 16th National Conf. of Australian Society of Operations Research: 1-11, 2001.
〔7〕A. Hagin, G. Dermler, K. Rotherml, Problem formulation, model and algorithms formapping distributed multimedia applications to distributed computer systems,Technical Report, Universitat Stuttgart, Fakultat Informatik, 1996
〔8〕Y. Hamam, K. S. Hindi, Assignment of program modules to processors: a
simulatedannealing approach, European Journal of Operational Research 122: 509-513, 2000
〔9〕 A. K. Tripathi, B. K. Sarker, N. Kumar, A GA Based Multiple Task
AllocationConsidering Load, International Journal of High Speed Computing: 203-214, 2000
〔9〕E. S. H. Hou, N. Ansari, H. Ren, A genetic algorithm for multiprocessor scheduling, IEEE Trans. Parallel and Distributed Systems 5: 113-120, 1994
〔10〕Bicking, F., Conrard, B., Thiriet, J.-M., "Integration of dependability in a task allocation problem", Instrumentation and Measurement, IEEE Transactions on, On page(s):
1455 - 1463 Volume: 53, Issue: 6, Dec. 2007
45
〔11〕張克誠，災後搶修設計工作人力指派最佳化之研究-國立中央大學土木系碩士論 文 2007
〔12〕T Zheng,Optimal Ant Colony Algorithm based Multi-RobotTask Allocation and Processing Sequence Scheduling* Intelligent Control and Automation, 2008. WCICA 2008.
7th World Congress on 25-27 June 2008
〔13〕Zhigang Lu ,An Improved ACO Algorithm for Service Restoration in Power Distribution SystemsPower and Energy Engineering Conference, 2009. APPEEC 2009.
Asia-Pacific
〔14〕S. M. Shatz, J. P. Wang, M. Goto, Task allocation for maximizing reliability
ofdistributed computing systems. IEEE Trans. Computers, vol.41, 1992, pp. 1156-1168.[13]J.
P. Wang, S. M. Shatz, Task allocation for optimized system reliability. In Proc. 7thSymposium on Reliable Distributed Systems, 1988, pp. 82-90
〔15〕M. S. Lin and D. J. Chen, Distributed program reliability analysis. In Proc.
3thWorkshop on Distributed Computing Systems, 1992, pp.395-401
〔16〕 S. Hariri, C. S. Raghavendra, Distributed functions allocation for reliability and delayoptimization. Proc. IEEE/ACM 1986 Fall Joint Computer Conf, 1986, pp. 344-352.
〔17〕R.Seethalakshmi,S.Savichandran “reliability analysis of programs in the distributed computing environment”,JATIA 2011
〔18〕V. K. P. Kumar, S. Hariri and C. S. Raghavendra. Distributed program reliabilityana lys is. IEEE Transaction on Software Engineering,1986,12 (1):42 50
〔19〕S .H aririan dC .S .R aghavendra.S YREL:A Symboilc Reliabiilty Algorithm based on Path and Cutset Methods ,USC Tech .R ep.,19 84,11 (3):52 64
〔20〕A .K umar ,S .R aian dD .P. Agrawal .Re liability e valuation Algorithms for Distributed System s .P roc.IN FOCOM'88,19 88:85 1860
〔21〕D. J. Chen and M. S. Lin, "On Distributed Computing Systems Reliability Analysis Under Program Constraints," IEEE Transaction on Computers, Vol. 16, No. 1, January, 1994.
〔22〕 Luiz Chaimowicz, Mario F. M. Campos, and Vijay Kumar, "Dynamic Role Assignment for Cooperative Robots," In Proc. of the IEEE Intl.Conf. on Robotics and Automation (ICRA), pages 293--298,Washington, DC, May 2002.",, pp. 293--298, 2002.
〔23〕 T. Dahl, S., M. J. Mataric, and G. S. Sukhatme, "Multi-Robot Task-Allocation through Vacancy Chains," 2003.
46
〔24〕 Brian P Gerkey and Maja J Mataric, "Multi-Robot Task Allocation:Analyzing the Complexity and Optimality of Key Architectures," Proc. ofthe IEEE Intl. Conf. On Robotics and Automation (ICRA), 2003.
〔25〕 Z. J. Czech and Piotr Czarnas, "Parallel Simulated Annealing for theVehicle Routing Problem With Time Windows," 2002.
〔26〕K. H. Kim and K. C. Moon, "Berth scheduling by simulated annealing,"Transportation Research Part B: Methodological, vol. 37, pp. 541-560,2003.[10]S. Melouk, P. Damodaran, and P.Y. Chang, "Minimizing makespan forsingle machine batch processing with non-identic al job sizes usingsimulated annealing," International Journal of Production Economics,vol. In Press, Corrected Proof, 2003.
〔27〕鄭承泰，服務率變化下M/M/1 排隊系統之最佳存貨控制-國防管理學院碩士論文 2003
〔28〕Naishuo Tian, Xinqiu Zhao,The M/M/1 Queue with Single Working Vacation
International Journal of Information and Management Sciences Volume 19, Number 4, pp.
621-634, 2008
〔29〕劉郁青，含有可變動服務者及阻礙概念之機器修理問題-中興大學應用數學系碩 士論文-2008
〔30〕R. E. Merwin and M. Mirherkerk, “Derivation and use of survivabilitycriterion for DDP systems,” in Proc. 1980 Nat. Comput. Conj, May1980, pp. 139-146.
〔31〕K. K. Aggrawal and S. Rai, “Reliability evaluation in computer communication networks,” IEEE Trans. Reliability, vol. R-30, pp.32-35, Apr. 1981.
〔32〕 A. Grnarov and M. Gerla, “Multiterminal reliability analysis of distributedprocessing system,” in Proc. 1981 Int. Conf Parallel Processing,Aug. 1986, pp. 79-86.
〔33〕 R. Kevin Wood, “Factoring algorithms for computing I; -terminalnetwork reliability,”
IEEE Trans. Reliability, vol. R-35, pp. 269-278,Aug. 1986.
〔34〕 Yan, S. and Chen, H.L., “A Scheduling Model and a Solution Algorithm forInter‐city Bus Carriers,” Transportation Research, Vol. 36A, pp. 805~825(2002).
〔35〕Méndez-Díaz, I., Zabala, P. and Lucena, A. (2008), “A new formulation for the traveling deliveryman problem,” Discrete Applied Mathematics, Vol. 156, No. 17, pp.
3223-3237.
〔36〕 Gengqian Liu, Tiejun Li, Yuqing Peng,and Xiangdan Hou, The ant algorithm for solving robot path planning problem,Proceedings of the International Conference on Information Technology and Applicatins (ICITA’05) 2005.
〔37〕 Tan Guan-Zheng, He Huan andSloman aron, Ant colony system algorithm for real-time globally optimal path planning of mobile robots, ACTA AUTOMATICA SINCA,
47 vol. 33, no. 3, pp. 279~285,
2007. (in Chinese with English abstract)
〔38〕.H. Thane and H. Hansson. Testing distributed real-time systems. Microprocessors and Microsystems, 24:463–478, 2001.
〔39〕Han-Pang Huang, and Shu-Yun Chung,Dynamic visibility graph for path planning, Proceedings of 2004 IEEE/RSJ International Conference on Intelligent and Systems, pp.
2813-2818, 2004.
〔40〕 Demot Madden, and Declan Delaney,Visibility path-finding in relation tohybrid strategy-based models indistributed interactive applications,Distributed simulation and real-timeapplication, pp. 91-97, 2004.
〔41〕 M. S. Lin. The Reliability Analysis on Distributed Computing Systems, PhD dissertation, National Chiao Tung University, Hsinchu, Taiwan, 1994.
〔42〕M. S. Lin, D. J. Chen, and M. S. Horng. The reliability analysis of distributed computing systems withimperfect nodes. Computer Journal, 42:129–141, 1999.
〔43〕林瑜禎，自來水管線維修工程人員機具指派最佳化-國立大學土木工程學系碩士 論文- 2011
〔44〕 M. S. Lin, D. J. Chen, and M. S. Horng A Heuristic Approach to Generating File Spanning Trees for Reliability Analysis of Distributed Computing Systems*, Computers Math. Applic. Vol. 34, No. 10, pp. 115-131, 1997