2026-10-12T03:53:08Z https://api.figshare.com/v2/oai

oai:figshare.com:article/33660195 2026-09-12T10:25:44Z category_146 category_734 category_931 category_106 category_132 category_140 portal_87 item_type_3 month_year_09_2026

A multi-objective constraint programming–satisfiability model for non-unit repetitive construction scheduling Luong Duc Long (24829629) Space Science Biological Sciences not elsewhere classified Information Systems not elsewhere classified Science Policy Infectious Diseases Cardiology Construction scheduling CP-SAT non-unit repetitive construction projects multi-objective optimization soft and hard sequencing requirements <p>Non-unit repetitive construction projects, in which activity groups are repeatedly executed over work-group-specific units rather than over a common set of identical production units, are difficult to schedule because activity sequences, crew movements, and execution logic vary across crew options. This study develops a multi-objective Constraint Programming–Satisfiability (CP-SAT) model for non-unit repetitive construction scheduling. The model integrates crew–option selection, interval-based scheduling, route-based crew logic, transfer-dependent travel times, optional interruption, and sequence control within a unified framework. Both soft and hard sequencing requirements are represented: soft sequences emerge from optimized crew routes, while hard sequences can enforce prescribed order, same-crew execution, and immediate-successor relationships when required. An exact ε-constraint procedure is used for the bi-objective time-cost case, while sampled frontier generation supports higher-dimensional trade-off analysis. From a practical perspective, the framework helps project managers compare feasible scheduling alternatives and balance competing priorities related to project deadlines, budget, construction quality, and crew continuity. The proposed model therefore provides a rigorous and practical decision-support framework for complex non-unit repetitive construction projects.</p> <p></p><p>CP-SAT model for non-unit repetitive scheduling.</p><p>Soft and hard sequencing are modeled explicitly.</p><p>Crew routes, travel, and interruption are jointly captured.</p><p>Duration, cost, quality, and interruption are optimized.</p><p>Exact and sampled Pareto strategies are distinguished.</p><p></p> <p>CP-SAT model for non-unit repetitive scheduling.</p> <p>Soft and hard sequencing are modeled explicitly.</p> <p>Crew routes, travel, and interruption are jointly captured.</p> <p>Duration, cost, quality, and interruption are optimized.</p> <p>Exact and sampled Pareto strategies are distinguished.</p> 2026-09-12T10:25:44Z Dataset Dataset 10.6084/m9.figshare.33660195.v1 https://figshare.com/articles/dataset/A_multi-objective_constraint_programming_satisfiability_model_for_non-unit_repetitive_construction_scheduling/33660195 CC BY 4.0