Application of the TCM 1 time coupling method in construction works scheduling

openaccess, Vol. 604 (12) 2022 / wtorek, 27 grudnia, 2022

(Open Access)

DOI: 10.15199/33.2022.12.15

Rogalska Magdalena, Hejducki Zdzisław. 2022. Application of the TCM 1 time coupling method in construction works scheduling. Volume 604. Issue 12. Pages 56-58. Article in PDF file

Accepted for publication: 28.10.2022 r.

The purpose of this work is to present the method of making a schedule in the form of a Gantt chart with the use of task scheduling using the time coupling method while maintaining the continuity of work of TCM 1 working teams. The traditional method of schedule visualization in TCM are cyclograms, in this work MS Project was used to prepare Gantt charts using the TCM 1 task scheduling method due to the need to use this program in the risk and cost analysis of the building life cycle, where it is necessary to use the Gantt chart to calculations.
  1. Hejducki Z, Rogalska M. Flow Shop scheduling of construction processes using time coupling methods/Lublin: Wydawnictwo Politechniki Lubelskiej, 2021; 138. ISBN 978-83-7947-467-7.
  2. Borne P. Evolutionary algorithms for job-shop scheduling Int. J. Appl. Math. Comput. Sci., 2004, Vol. 14, No 1, 91-103.
  3. Bożejko W, Wodecki M. A hybrid evolutionary algorithm for some discrete optimization problems, IEEE Computer Society P2286 ISBN 0-7695-2286-6, 2.
  4. Leu SS, Yang CH, Huang JC Resource leveling in construction by genetic algorithm-based optimization and its decision support system application. Automation in Construction 2000; 10: 27-41.
  5. Nassar K. Evolutionary optimization of resource allocation in repetitive construction schedules ITcon. 2005; 10:265.
  6. Reewers CR. Yamada T. Genetic Algorithms Path Relinking on the Flowshop Sequencing Problem, Evolutionary Computation Journal MIT press. 1998; 6(1):230-234.
  7. Afanasjev VA. Stream methods in construction work, Potocnaja organizacja rabot v stroitelstwie, Sankt Petersburg. 2000.
  8. Arditi D, Tokdemir OB, Suh K. Effect of learning on line-of-balance scheduling, International Journal of Project Management, 2001; 19(5): 265-277.
  9. Grabowski J, Wodecki M. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Computers & Operations Research, 2004; 31: 1891-1909.
  10. Gupta J, Stafford EF Jr. Flowshop scheduling research after five decades, European Journal of Operational Research 2006; 169: 699-711.
dr hab inż Magdalena Rogalska, Politechnika Lubelska, Wydział Budownictwa i Architektury ORCID: 0000-0001-8408-3242
prof. dr hab inż Zdzisław Hejducki, Politechnika Wrocławska, Wydział Budownictwa Lądowego i Wodnego ORCID: 0000-0003-2958-0128

prof. dr hab inż Zdzisław Hejducki, Politechnika Wrocławska, Wydział Budownictwa Lądowego i Wodnego ORCID: 0000-0003-2958-0128

Full paper:

DOI: 10.15199/33.2022.12.15

Article in PDF file