论文信息 - Project management in building process with uncertain tasks times - 字舞流文

Project management in building process with uncertain tasks times

Wojciech Bożejko | Zdzisław Hejducki | Paweł Rajba | Mieczysław Wodecki | W. Bożejko | M. Wodecki | Z. Hejducki | Paweł Rajba

[1] Edmundas Kazimieras Zavadskas. Book Review. Methods and Models of Research in Construction Project Engineering , 2008 .

[2] Edmundas Kazimieras Zavadskas,et al. History and evolving trends of construction colloquia on sustainability and operational research , 2008 .

[3] David K. Smith,et al. The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[4] Wojciech Bozejko,et al. Solving the Flow Shop Problem by Parallel Simulated Annealing , 2001, PPAM.

[5] I. Osman,et al. Simulated annealing for permutation flow-shop scheduling , 1989 .

[6] E. Nowicki,et al. A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[7] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[8] J. Vondrák. Probabilistic Methods in Combinatorial and Stochastic Optimization , 2005 .

[9] Colin R. Reeves,et al. A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[10] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[11] Brian C. Dean,et al. Approximation algorithms for stochastic scheduling problems , 2005 .

[12] Mieczysław Wodecki,et al. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..