PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2011 | 2 | nr 1 | 3--9
Tytuł artykułu

Project Management in Building Process with Uncertain Tasks Times

Treść / Zawartość
Warianty tytułu
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.(original abstract)
Rocznik
Tom
2
Numer
Strony
3--9
Opis fizyczny
Twórcy
  • Wrocław University of Science and Technology, Poland
  • Wrocław University of Science and Technology, Poland
autor
  • University of Wrocław
  • University of Wrocław
Bibliografia
  • 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.
  • 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.
  • Ustinovicius L., Decision-support System for Determining the Efficiency of Investments in Construction: Summary of the research report presented for habilitation, Vilnius, Technika, 2003.
  • Dean B.C., Approximation algorithms for stochastic scheduling problems, PhD thesis, MIT, 2005.
  • Vondr´ak J., Probabilistic methods in combinatorial and stochastic optimization, PhD, MIT, 2005.
  • 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.
  • Ishii H., Fuzzy combinatorial optimization, Japanese Journal of Fuzzy Theory and Systems, 4, 1, 31-40, 1992.
  • Garey M.R., Johnson D.S. and Seti R., The complexity of flowshop and jobshop scheduling, Mathe- matics of Operations Research, 1, 117-129, 1976.
  • Osman I., Potts C., Simulated Annealing for Permutation Flow-Shop Scheduling, OMEGA, 17/6, 551- 557, 1989.
  • Ogbu F., Smith D., The Application of the Simulated Annealing Algorithm to the Solution of the n/m/Cmax Flowshop Problem, Computers & Oper- ations Research, 17/3, 243-253, 1990.
  • Bożejko W., Wodecki M., Solving Flow Shop Problem by Parallel Simulated Annealing, LNCS, Springer-Verlag, 2328, 236-244, 2002.
  • Nowicki E., Smutnicki C., A fast tabu search algorithm for the permutation flow-shop problem, Euro- pean Journal of Operational Research, 91, 160-175, 1996.
  • 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.
  • Reeves C., A Genetic Algorithm for Flowshop Sequencing, Computers & Operations Research, 22/1, 5-13, 1995.
  • Karp R.M., Reducibility among combinatorial problems, R.E. Miller and J.W. Thatcher [Eds.], Com- plexity of Computer Computation, Plenum Press, New York, 1972, pp. 85-104.
  • Dubois D., Prade H., Theorie des Possibilites. Applications a la representation des connaissances en informatique, Paris: MASSON, 1988.
  • OR Library http://people.brunel.ac.uk/mastjjb/jeb/ orlib/flowshopinfo.html
  • 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.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.ekon-element-000171569613

Zgłoszenie zostało wysłane

Zgłoszenie zostało wysłane

Musisz być zalogowany aby pisać komentarze.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.