Tetris-inspired approach for generating tightly-packed repetitive schedules

Abstract

Scheduling repetitive projects such as highways and High-rise buildings to meet strict deadlines is challenging, particularly when the repetitive units (sections/floors) are non-identical and resources are limited. In this case, conventional CPM/LOB schedules exhibit large time gaps, causing project delays. This paper proposes computational and geometrical enhancements to generate tightly-packed repetitive schedules, envisaged by the game of Tetris. The paper introduces novel procedures to overcome existing scheduling challenges: (1) revised computation to better determine tasks' delivery rates that meet deadlines; (2) formulation of mid-activity interruption time and mid-activity rate changes that synchronize task delivery rates; (3) multi-crew arrangement method, As-Soon-As-Possible, that better suits non-identical units; and (4) a simplified heuristic combining all procedures above to generate tightly-packed schedules with shorter durations. As presented in the paper through examples, the proposed techniques reduce the duration of complex repetitive projects using enhanced schedule computation and geometry rather than using expensive acceleration/optimization methods.