|
參考文獻
[1]M. Pinedo, Scheduling : theory, algorithms, and systems, Prentice Hall, Inc, pp. 118-141, 1995.
[2]R.W. Conway, W.L. Maxwell and L.W. Miller, Theory of Scheduling, Addison-Wesley, pp. 42-51, 1967.
[3]D.M. Lei and H.J. Xiong, "An efficient evolutionary algorithm for multi-objective stochastic job shop scheduling," in Proc. Of Sixth International Conference on Machine Learning Cybernetics, Hong Kong, pp. 867-872, 2007.
[4]B.D. Parrello, W.C. Kabat and L. Wos, "Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem," Journal of Automated Reasoning, 1986, Vol. 2, Issue 1, pp. 1-42
[5]M. Pinedo, "Stochastic scheduling with release dates and due dates," Operations Research, Vol.31, pp. 559-572, 1983.
[6]R.R. Weber, P. Varaiya, J. Walrand, "Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flow time," Journal of Applied probability, Vol. 23, pp. 841-847, 1986.
[7]C. Rajendran and O. Holthaus, "A comparative study of dispatching rules in dynamic flow shops and job shops," European Journal of Operational Research, Vol. 116, pp. 156-170, 1999.
[8]S.R. Lawrence, E.C. Sewell, "Heuristic, optimal, static, and dynamic schedules when processing time are uncertain," Journal of Operations Management, Vol.15, pp. 71-82, 1997.
[9]G.G. Dimitri, K. Shmuel and L. Zinoviy, "Industrial job-shop scheduling with random operations and different priorities," International Journal of Production Economics, Vol. 40, pp. 185-195, 1995.
[10]K. Deb, A. Pratap and S. Agarwal, "A fast and elitist multiobjective genetic algorithm: Nsga-II," IEEE Trans. Evol. Comput., pp. 182-197, 2002.
[11]H. Ishibuch, T. Yoshida and T. Murata, "Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling," IEEE Trans. Evol. Comput., pp. 204-223, 2003.
[12]J.K. Kishore, L.M. Patnaik, V. Mani, et al, "Application of genetic programming for multicategory pattern classification," IEEE Trans. Evol. Comput., pp. 242-258, 2000.
[13]M.G. de Carvalho, A.H.F. Laender, M.A. Goncalves, et al, "A genetic programming approach to record deduplication," IEEE Trans. Knowl. Data. Eng., pp. 399-412, 2012.
[14]B. Naderi and A. Azab, "Modeling and heuristics for scheduling of distributed job shops," Expert Systems with Applications, Vol. 41, Iss. 17, pp. 7754–7763, 2014.
[15]A. Azadeh, A. Negahban and M. Moghaddam, "A hybrid computer simulation-artificial neural network algorithm for optimisation of dispatching rule selection in stochastic job shop scheduling problems," International Journal of Production Research, Vol. 50, No. 2, pp. 551-566, 2012.
[16]S.X. Yang and D.W. Wang, "A new adaptive neural network and heuristics hybrid approach for job-shop scheduling," Computers & Operations Research, Vol. 28, Iss. 10, pp. 955-971, 2001.
[17]R. Mencía, M.R. Sierra, C. Mencía and R. Varela, "Memetic algorithms for the job shop scheduling problem with operators," Applied Soft Computing, Vol. 34, pp. 94-105, 2015.
[18]Y.H. Shi, Recent algorithms and applications in swarm intelligence research, IGI Global, 2012.
[19]A. Muthiah and R. Rajkumar, "A Comparison of Artificial Bee Colony algorithm and Genetic Algorithm to Minimize the Makespan for Job Shop Scheduling," Procedia Engineering, Vol. 97, pp. 1745-1754, 2014.
[20]C.H. Chen and L.H. Lee, Stochastic simulation optimization: An optimal computing budget allocation, World Scientific, 2010.
[21]F. Azadivar, "Simulation optimization methodologies, " Processings of the 1999 Winter Simulation Conference, Phoenix, AZ, pp. 93-100, 1999.
[22]A.G. Greenwood, L.P. Rees, and F.C. Siochi, "An investigation of the behavior of simulation response surfaces," European Journal of Operational Research, Vol. 110, pp. 282-313, 1998.
[23]J.R. Swisher, P.D. Hyden, S.H. Jacobson and L.W. Schruben, "A survey of simulation optimization techniques and procedures," Proceedings of the 2000 Winter Simulation Conference, Vol. 1, pp. 119-128, 2000.
[24]S.M. Robinson "Analysis of sample-path optimization," Mathematics of Operations Research, Vol. 21, No. 3, pp. 513-528, 1996.
[25]Y. Carson and A. Maria, "Simulation optimization: methods and applications," Proceedings of the 1997 Winter Simulation Conference, Atlanta, GA, pp. 118-126, 1997.
[26]B. Suman and P. Kumar, "A survey of simulated annealing as a tool for single and multi objective optimization," Journal of the Operational Research Society, Vol.57, No.10, pp. 1143-1160, 2006.
[27]A.R. Hedar and M. Fukushima, "Tabu Search directed by direct search methods for nonlinear global optimization," European Journal of Operational Research, Vol.170, No.2, pp. 329-349, 2006.
[28]R.L. Haupt and S.E. Haupt, "Practical genetic algorithms," 2nd edition, Hoboken, John Wiley, 2004.
[29]E. Tekin and I. Sabuncuoglu, "Simulation optimization: A comprehensive review on theory and applications," IIE Transactions, Vol.36, No.11, pp. 1067-1081, 2004.
[30]P. Civicioglu, "Backtracking Search Optimization Algorithm for numerical optimization problems," Applied Mathematics and Computation, Vol. 219, Iss. 15, pp. 8121–8144, 2013.
[31]Ren Qing-dao-er-ji, Y. Wang, "A new hybrid genetic algorithm for job shop scheduling problem," Computers & Operations Research, Vol.39, pp. 2291-2299, 2012.
[32]D. Moore and G. McCabe, Introduction to the Practice of Statistics. (3rd Edition), W.H. Freeman and Company, 1999.
|