Project management in building process with uncertain tasks times

• Autorzy: Bożejko, W. , Hejducki, Z. , Rajba, P. , Wodecki, M.
• Języki publikacji: EN

Abstrakty

EN

In this paper there is presented a problem of scheduling of construction work in which certain projects must be executed. Every work consists of projects executed by separate teams. In a linear system the sequence of works is the same for every project. Uncertain tasks times are represented by fuzzy numbers or distribution of random variables. We present a tabu search algorithm and computational experiments which are aimed at checking the sustainability of set solutions.

Słowa kluczowe

PL

planowanie budowy; system liniowy; algorytm

EN

planning of building; linear system; uncertain tasks times; tabu search algorithm

• Czasopismo: Management and Production Engineering Review
• Rocznik: 2011
• Tom: Vol. 2, No. 1
• Strony: 3-9
• Opis fizyczny: Bibliogr. 18 poz., rys., tab.

Twórcy

autor

Bożejko, W.

autor

Hejducki, Z.

autor

Rajba, P.

autor

Wodecki, M.

• University of Wrocław, Institute of Computer Science, Joliot-Curie 15, 50-383 Wrocław, Poland, phone: [phone],

Bibliografia

• [1] Zavadskas E.K., Book review. Methods and models of research in construction projects engineering, Journal of Business Economics and Management, 9, 3, 240-243, 2008.
• [2] Zavadskas E.K., History and evolving trends of construction colloquia on sustainability and operational research, Technological and Economic Development of Economy, 14, (4), 578-592, 2008.
• [3] Ustinovicius L., Decision-support System for Determining the Efficiency of Investments in Construction: Summary of the research report presented for habilitation, Vilnius, Technika, 2003.
• [4] Dean B.C., Approximation algorithms for stochastic scheduling problems, PhD thesis, MIT, 2005.
• [5] Vondràk J., Probabilistic methods in combinatorial and stochastic optimization, PhD, MIT, 2005.
• [6] Ishibuschi H., Murata T., Scheduling with Fuzzy Duedate and Fuzzy Processing Time, in: Scheduling Under Fuzziness, R. Słowiński and M. Hapke [Eds.], Springer-Verlag, 2000, pp. 113-143.
• [7] Ishii H., Fuzzy combinatorial optimization, Japanese Journal of Fuzzy Theory and Systems, 4, 1, 31-40, 1992.
• [8] Garey M.R., Johnson D.S. and Seti R., The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1, 117-129, 1976.
• [9] Osman I., Potts C., Simulated Annealing for Permutation Flow-Shop Scheduling, OMEGA, 17/6, 551-557, 1989.
• [10] Ogbu F., Smith D., The Application of the Simulated Annealing Algorithm to the Solution of the n/m/Cmax Flowshop Problem, Computers & Operations Research, 17/3, 243-253, 1990.
• [11] Bożejko W., Wodecki M., Solving Flow Shop Problem by Parallel Simulated Annealing, LNCS, Springer-Verlag, 2328, 236-244, 2002.
• [12] Nowicki E., Smutnicki C., A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research, 91, 160-175, 1996.
• [13] Grabowski J., Wodecki M., A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Computers & Operations Research, 31, 1891-1909, 2004.
• [14] Reeves C., A Genetic Algorithm for Flowshop Sequencing, Computers & Operations Research, 22/1, 5-13, 1995.
• [15] Karp R.M., Reducibility among combinatorial problems, R.E. Miller and J.W. Thatcher [Eds.], Complexity of Computer Computation, Plenum Press, New York, 1972, pp. 85-104.
• [16] Dubois D., Prade H., Theorie des Possibilites. Applications a la representation des connaissances en informatique, Paris: MASSON, 1988.
• [17] OR Library http://people.brunel.ac.uk/mastjjb/jeb/orlib/flowshopinfo.html
• [18] Navaz M., Enscore E.E. and Ham I., A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA, 11/1, 91-95, 1983.