PulseTrendingJournal ClubResearchersJournalsExplore
Instagram
HomeTrendingJournal ClubExplore
Synapse
⌘+K
Synapse
September 14, 2026International Journal of Construction Management

A multi-objective constraint programming–satisfiability model for non-unit repetitive construction scheduling

View Full Paper
Ask AI
Bookmark
Share

Authors

LLLuong Duc Long

Discussion

Loading...

Member takes

Overview

Computational modeling demonstrates optimized multi-objective schedule generation in non-unit repetitive construction, highlighting improved trade-offs across cost, duration, and crew continuity.

Key Points

  • Develop a unified multi-objective Constraint Programming–Satisfiability (CP-SAT) model to optimize schedules for non-unit repetitive construction projects characterized by flexible crew logic and varying activity sequences.
  • Formulated a CP-SAT mathematical model integrating crew-option selection, interval-based scheduling, route-based logic, transfer travel times, optional work interruptions, and soft and hard sequencing constraints.
  • Applied an exact ε-constraint procedure to solve bi-objective time-cost trade-offs and implemented sampled frontier generation to analyze higher-dimensional trade-offs.
  • Successfully modeled complex operational constraints, including soft sequences driven by crew routing and hard sequences requiring specific crew continuity or immediate-successor logic.
  • Generated feasible scheduling alternatives that provide decision support for balancing competing project goals such as deadlines, total budget, construction quality, and crew workflow continuity.

Cite This Study

Luong Duc Long (2026) studied this question.

synapsesocial.com/papers/6aa7b3950926e14a848b2b09https://doi.org/10.1080/15623599.2026.2724960
View Full Paper
Ask AI
Bookmark
Share