| 參考文獻 |
中文部分
柯惠雯. (2000). 結合模擬退火法與禁忌搜尋法在流程式生產排程之應用. 大葉大學碩士學位論文。
陳昭吉. (2003). 應用遺傳基因演算法於晶圓製造廠之施規佈置問題. 元智大學工業工程與管理系碩士學位論文。
曾佳盈. (2012). 以分枝界限法求解可中斷式開放工廠排程問題. 朝陽科技大學工業工程與管理系學位論文。
劉昱德. (2007). 比較三種萬用啓發式演算法於 TSP 問題之探討. 國立高雄應用科技大學工業工程與管理系碩士論文。
蘇恆磊.(2001).「遺傳演算法於零工式生產排程系統之應用. 國立海洋大學系統工程暨造船學系碩士論文。
英文部分
Aydilek, H., & Allahverdi, A. (2013). A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times. Applied Mathematical Modelling, 37(12-13), 7164-7173.
Afshar-Nadjafi, B., Rahimi, A., & Karimi, H. (2013). A genetic algorithm for mode identity and the resource constrained project scheduling problem. Scientia Iranica,20(3), 824-831.
Bagheri, A., Zandieh, M., Mahdavi, I., & Yazdani, M. (2010). An artificial immune algorithm for the flexible job-shop scheduling problem. Future Generation Computer Systems, 26(4), 533-541.
Bank, M., Fatemi Ghomi, S. M. T., Jolai, F., & Behnamian, J. (2012a). Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration. Advances in Engineering Software, 47(1), 1-6.
Bank, M., Fatemi Ghomi, S. M. T., Jolai, F., & Behnamian, J. (2012b). Two-machine flow shop total tardiness scheduling problem with deteriorating jobs. Applied Mathematical Modelling, 36(11), 5418-5426.
Brucker, P., Burke, E. K., & Groenemeyer, S. (2012). A branch and bound algorithm for the cyclic job-shop problem with transportation. Computers & Operations Research, 39(12), 3200-3214.
Chandra, C., Liu, Z., He, J., & Ruohonen, T. (2014). A binary branch and bound algorithm to minimize maximum scheduling cost. Omega, 42(1), 9-15.
Chen, W. (2009). Minimizing number of tardy jobs on a single machine subject to periodic maintenance. Omega, 37(3), 591-599.
Cheng, T. C. E., Wu, C.-C., Chen, J.-C., Wu, W.-H., & Cheng, S.-R. (2013). Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. International Journal of Production Economics, 141(1), 79-86.
Cheng, T. C. E., Wu, W.-H., Cheng, S.-R., & Wu, C.-C. (2011). Two-agent scheduling with position-based deteriorating jobs and learning effects. Applied Mathematics and Computation, 217(21), 8804-8824.
Damodaran, P., & Vélez-Gallego, M. C. (2012). A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times. Expert Systems with Applications, 39(1), 1451-1458.
Gharbi, A., Ladhari, T., Msakni, M. K., & Serairi, M. (2010). Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times. Electronic Notes in Discrete Mathematics, 36, 1089-1096.
Gharbi, A., Ladhari, T., Msakni, M. K., & Serairi, M. (2013). The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies. European Journal of Operational Research, 231(1), 69-78.
Huang KL, Liao CJ. (2006). Ant colony optimization combined with tabu search for the job shop scheduling problem. Computers and Operations Research; 35(4):1030–46.
Jarosław, P., Czesław, S., & Dominik, Ż. (2013). Optimizing bicriteria flow shop scheduling problem by simulated annealing algorithm. Procedia Computer Science, 18, 936-945.
Lee, W.-C., Shiau, Y.-R., Chen, S.-K., & Wu, C.-C. (2010). A two-machine flowshop scheduling problem with deteriorating jobs and blocking. International Journal of Production Economics, 124(1), 188-197.
Lin SW, Ying KC. (2008). A hybrid approach for single-machine tardiness problems with sequence-dependent setup times. Journal of the Operational Research Society;59:1109–19.
Low, C., & Lin, W. Y. (2013). Some scheduling problems with time-dependent learning effect and deteriorating jobs. Applied Mathematical Modelling.
Mazloumi, E., Mesbah, M., Ceder, A., Moridpour, S., & Currie, G. (2012). Efficient transit schedule design of timing points: a comparison of ant colony and genetic algorithms. Transportation Research Part B: Methodological, 46(1), 217-234.
Ng, C. T., Wang, J. B., Cheng, T. C. E., & Liu, L. L. (2010). A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Computers & Operations Research, 37(1), 83-90.
Pang, K.-W. (2013). A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness. International Journal of Production Economics, 141(1), 127-136.
Pinedo, M. L. (2012). Scheduling: Theory, Algorithms, and Systems. Springer, New York.
Wang, J.-B., & Wang, M.-Z. (2013). Minimizing makespan in three-machine flow shops with deteriorating jobs. Computers & Operations Research, 40(2), 547-557.
Wang, X., Xie, X., & Cheng, T. C. E. (2013). Order acceptance and scheduling in a two-machine flowshop. International Journal of Production Economics, 141(1), 366-376.
Wu, C.-C., Wu, W.-H., Hsu, P.-H., & Lai, K. (2012). A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function. Applied Mathematical Modelling, 36(10), 5001-5014.
Wu, Y.-B., Wang, M.-Z., & Wang, J.-B. (2011). Some single-machine scheduling with both learning and deterioration effects. Applied Mathematical Modelling, 35(8), 3731-3736.
Yang, D. L., & Kuo, W. H. (2010). Some scheduling problems with deteriorating jobs and learning effects. Computers & Industrial Engineering, 58(1), 25-28.
Yang, S.-J. (2011). Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine. Applied Mathematical Modelling, 35(8), 4008-4016.
Yang, S.-J., & Yang, D.-L. (2010). Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities. Omega, 38(6), 528-533.
Yao, S., Jiang, Z., & Li, N. (2012). A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals. Computers & Operations Research, 39(5), 939-951.
Zhang CY, Li P, Rao Y, Guan Z. (2008). A very fast TS/SA algorithm for the job shop scheduling problem. Computers and Operations Research;35(1): 282–94.
|
