• HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
Tuesday, November 17, 2026
BIOENGINEER.ORG
No Result
View All Result
  • Login
  • HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
        • Lecturer
        • PhD Studentship
        • Postdoc
        • Research Assistant
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
  • HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
        • Lecturer
        • PhD Studentship
        • Postdoc
        • Research Assistant
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
No Result
View All Result
Bioengineer.org
No Result
View All Result
Home NEWS Science News Technology

Optimization Model Compresses Construction Schedules to Sixty-Two Days Under Periodic Budget Caps

by
November 17, 2026
in Technology
Reading Time: 6 mins read
0
Optimization Model Compresses Construction Schedules to Sixty-Two Days Under Periodic Budget Caps

Optimization Model Compresses Construction Schedules to Sixty-Two Days Under Periodic Budget Caps

Share on FacebookShare on TwitterShare on LinkedinShare on RedditShare on Telegram

A novel deterministic bi-objective optimization model developed for construction scheduling has demonstrated that integrating strict multi-period financial constraints with evolutionary metaheuristics can compress project timelines to mathematically validated physical limits. Conducted by civil engineering researcher Nima Amani and published in Discover Civil Engineering, the investigation introduces an analytical framework designed to resolve the multi-mode project scheduling problem by concurrently minimizing project duration and direct construction expenditures. Using an empirical case study centered on a flooring installation network within an eighteen-story government building in central Tehran, the optimization methodology successfully reduced the project’s baseline critical path duration from seventy-seven working days down to a robust Pareto-optimal baseline of sixty-four working days. By establishing a dual-layer verification protocol benchmarking metaheuristic results against an exact global mathematical solver, the study confirms that computational algorithms reliably navigate severe combinatorial constraints while honoring hard periodic budget boundaries, providing construction managers with actionable schedules that avoid localized funding shortfalls during execution.

The operational management of infrastructure projects is persistently challenged by the time-cost trade-off problem, where expediting activities requires greater resource allocations and capital expenditures. Conventional project scheduling techniques frequently treat project financing as a single static pool of capital assigned across the entire timeline. This simplification overlooks the practical financial friction of multi-period cash caps and phased disbursements typical of modern procurement. When activities shift to compress delivery dates, localized spending rates fluctuate, triggering periodic budget breaches even when total costs satisfy overall limits. Furthermore, modern construction projects exhibit exponential combinatorial growth, where individual tasks offer multiple discrete execution modes with distinct duration and resource requirements. For instance, a relatively modest network comprising eighteen activities with four execution options yields over 6.5 million potential scheduling permutations, making exhaustive analytical enumeration computationally impossible for project planners.

To overcome these limitations, the research formulated a comprehensive mathematical programming architecture grounded in network Critical Path Method principles under strict periodic budget caps. The project network is formally defined as a set of interconnected activities governed by prerequisite relationships, stipulating that successor tasks cannot commence until preceding activities finish. To establish unambiguous temporal boundaries, two virtual activities possessing zero duration are introduced at the initial and terminal positions of the network. The mathematical model integrates two explicit objective functions: the primary objective minimizes overall project completion time along the critical path, while the secondary objective minimizes cumulative project direct costs. This cost formulation explicitly incorporates the expenditures for renewable labor, non-renewable materials, and daily overhead expenses, defined at two hundred monetary units per execution day. Operational constraints enforce unique execution modes per activity, calculate precise start and completion timestamps, prohibit activity interruptions once initiated, and restrict concurrent resource usage within predetermined capacity limits.

Navigating this non-linear combinatorial search space required a calibrated multi-objective metaheuristic, specifically the Non-dominated Sorting Genetic Algorithm II (NSGA-II). The algorithm uses a discrete, dual-layer chromosomal encoding designed to map activity sequencing and execution mode selections simultaneously. To ensure initial candidate solutions respect network precedence logic without producing unfeasible sequences, the starting population is constructed using a modified topological sort heuristic. Algorithmic hyper-parameters were tuned through preliminary trials to maintain population diversity while driving convergence toward the true Pareto frontier, adopting a population size of 100 individuals evolved across 500 generations. Genetic recombination was executed via a two-point crossover operator with a probability rate of 0.85, paired with a swap mutation operator applied at a rate of 0.05. Parent selection relied on standard binary tournament mechanisms, elite solutions were preserved using crowding-distance elitism, and non-feasible vectors violating periodic budget or resource boundaries were penalized dynamically across 30 independent runs.

Because evolutionary metaheuristics operate through stochastic population-based searches that cannot inherently guarantee global mathematical optimality, the study incorporated a dual-layer validation architecture to evaluate algorithmic precision. The Pareto-optimal frontier generated by NSGA-II in MATLAB was benchmarked against an exact global optimization baseline solved using the General Algebraic Modeling System, or GAMS. Exact mathematical programming models provide guaranteed optimality in bounded project networks but encounter severe computational barriers, including exponential runtime growth and memory limits, as project networks expand. In this comparative evaluation, the exact GAMS solver proved that solutions produced by the metaheuristic aligned closely with global optima. Across varying budgetary allocations, the metaheuristic exhibited an average mean cost deviation of only 0.19% relative to exact mathematical targets. Furthermore, the maximum observed cost variance across the experimental suite did not exceed 0.62%, demonstrating that the calibrated evolutionary operators preserved rigorous structural precision and convergence without incurring excessive computational overhead.

The empirical case study that validated this analytical framework centered on the flooring installation across the fifth floor of an eighteen-story administrative building spanning approximately 25,000 square meters in Tehran. Drawing on historical performance metrics and observed site conditions from the preceding four floors, the construction operation was modeled as a network of thirteen interdependent activities. Under conventional calculations, the baseline operation exhibited an optimistic duration of 57 days, a realistic duration of 77 days, and a pessimistic upper bound of 100 days. The model incorporated four renewable labor resources—designated as master of work K1, skilled worker K2, and secondary labor classifications K3 and K4—with unit costs established at 30, 50, 45, and 40 monetary units per period, respectively, against a baseline capacity limit of 10 units each. Additionally, non-renewable materials were integrated into the formulation, encompassing primary stone at 5 monetary units and cement at 3 monetary units, alongside the fixed daily overhead cost of 200 monetary units.

To evaluate how resource constraints govern model behavior, the author performed a single-factor sensitivity analysis on renewable labor thresholds using a controlled ceteris paribus design. Each target resource was systematically varied from 5 to 15 units while the remaining three labor types were held constant at their baseline value of 10 units. The tests confirmed that the baseline capacity of 10 units acted as a binding constraint across all categories. Specifically, master of work K1 exerted the most significant impact on project completion time: reducing K1 capacity to 9 units extended completion time from 25 to 29 days, whereas increasing it to 11 compressed the schedule to 24 days. Conversely, skilled worker K2 exerted the greatest influence over final project cost, where expanding K2 to maximum availability decreased project duration by 2 time units and reduced final expenditures by 3,410 monetary units. Resource K3 at its minimum level decreased project time by 5 units and cost by 39,950 units. For resource K4, setting capacity to 5 yielded no feasible solution, though its minimum feasible level decreased project duration by 6 time units and total cost by 1,240 units.

A defining result of the optimization analysis was the extraction of a compact Pareto frontier containing exactly four non-dominated solutions. Far from indicating an algorithmic limitation or insufficient genetic diversity, this sparse Pareto set directly reflects the structural realities of the project network. Because the mathematical framework incorporates discrete activity sequences, discrete execution modes, tight labor boundaries, and rigid periodic budget caps, the feasible objective space is inherently discontinuous and tightly restricted. Under standard operational boundaries, only four distinct trade-off configurations exist where duration reductions can be achieved without violating constraints or exponentially escalating total cost. Cross-validation against the exact GAMS solver yielded the identical four Pareto points, confirming that the population of 100 individuals over 500 generations converged completely on the exhaustive global frontier. In practice, Solution 4 provides the shortest timeline for managers prioritizing project speed, Solution 1 offers the lowest overall expenditure for budget-constrained projects, and intermediate solutions present balanced options between completion time and implementation cost.

The investigation further analyzed the interaction between financial allocation and schedule compression through sensitivity testing across budget levels, ranging from Level 20 representing 20,000 monetary units up to Level 40 representing 40,000 units. The findings revealed that while increasing funding initially accelerates execution by enabling faster, resource-intensive execution modes, this relationship encounters clear physical plateaus. Relaxing financial limits from baseline allowed the metaheuristic to compress total duration to 63 days at intermediate funding thresholds. When the budget ceiling reached its maximum of 40,000 units, exact mathematical validation in GAMS uncovered the absolute physical lower bound of 62 working days. Beyond this threshold, further capital injections yielded diminishing returns, failing to achieve additional schedule compression. Instead, excess capital increased overall project expenditure by driving mode selections toward resource-intensive choices that enhanced activity quality rather than shortening duration, demonstrating that construction networks possess unyielding physical limits that budget increases alone cannot surpass.

By demonstrating that schedule acceleration is strictly bounded by localized resource constraints and physical network logic, this research delivers critical decision-support capabilities for construction executives, contractors, and public procurement authorities. In fixed-price contracting, where infrastructure projects regularly face cash-flow turbulence and staged funding limits, embedding multi-period budget constraints into baseline scheduling frameworks prevents unexpected fiscal breaches during execution. Furthermore, the dual-layer verification paradigm proves that calibrated metaheuristics solve intricate combinatorial scheduling problems in seconds while maintaining near-exact agreement with global targets, bypassing exponential computational barriers that make analytical solvers impractical on larger network scales. While the current formulation focuses on the bi-objective optimization of project duration and direct cost, it establishes a solid quantitative foundation for future extensions. The author notes that subsequent research can constructively expand this deterministic model into a three-objective architecture by operationalizing execution quality indices from historical data, modeling stochastic activity uncertainties, and testing alternative evolutionary algorithms across diverse infrastructure sectors.

Subject of Research: Multi-objective optimization of project duration and costs under periodic budget constraints

Article Title: Multiobjective optimization model for project time and cost management under multiperiod financial constraints

Article References: Amani, N. (2026). Multiobjective optimization model for project time and cost management under multiperiod financial constraints. Discover Civil Engineering, 3(1), Article 283. https://doi.org/10.1007/s44290-026-00678-6

Image Credits: AI Generated

DOI: 10.1007/s44290-026-00678-6

Keywords: multi-objective optimization, project scheduling, time-cost trade-off, periodic budget constraints, non-dominated sorting genetic algorithm, critical path method, NSGA-II, General Algebraic Modeling System, combinatorial optimization, Pareto frontier, construction engineering, sensitivity analysis, resource allocation, infrastructure project management, discrete execution modes, mathematical programming, dual-layer validation, construction economics

News Source: Denise Maddox. (November 17, 2026). Optimization Model Compresses Construction Schedules to Sixty-Two Days Under Periodic Budget Caps. Scienmag.

Tags: combinatorial optimizationconstruction economicsconstruction engineeringcritical path methoddiscrete execution modesdual-layer validationGeneral Algebraic Modeling Systeminfrastructure project managementmathematical programmingMulti-objective optimizationnon-dominated sorting genetic algorithmNSGA-IIPareto frontierperiodic budget constraintsproject schedulingresource allocationSensitivity analysistime-cost trade-off
Share12Tweet7Share2ShareShareShare1

Related Posts

New Stochastic Path Sampler Improves Efficiency in Lattice Field Theory

New Stochastic Path Sampler Improves Efficiency in Lattice Field Theory

November 17, 2026
Potassium Hydroxide and Calcium Lignosulfonate Triple Expansive Black Cotton Soil Strength

Potassium Hydroxide and Calcium Lignosulfonate Triple Expansive Black Cotton Soil Strength

November 17, 2026

Blockchain-Backed Federated Learning Improves Anomaly Detection in Industrial IoT Networks

November 17, 2026

Swiss Hospital Study Reveals Limited Overlap in Standardized Clinical Data Adoption

November 17, 2026

POPULAR NEWS

  • Pharmacist Prescribing for Urinary Tract Infections Shows High Symptom Resolution

    Pharmacist Prescribing for Urinary Tract Infections Shows High Symptom Resolution

    29 shares
    Share 12 Tweet 7
  • Bioactive Adrenomedullin Rises During Hemorrhagic Shock and Stabilizes With Fluid Resuscitation

    29 shares
    Share 12 Tweet 7
  • Serious Gaming Platform Validated for Basic Laparoscopic Skills Training

    29 shares
    Share 12 Tweet 7
  • Anti-Aging Drugs Show Sex-Specific Interleukin-11 Effects in Mouse Abdominal Fat

    29 shares
    Share 12 Tweet 7

About

We bring you the latest biotechnology news from best research centers and universities around the world. Check our website.

Follow us

Recent News

Plonmarlimab Shows High Response in Macrophage Activation Syndrome Clinical Trial

Taghit Oasis Date Palms Show Four Decades of Varietal Turnover and Diversity

New Stochastic Path Sampler Improves Efficiency in Lattice Field Theory

Subscribe to Blog via Email

Enter your email address to subscribe to this blog and receive notifications of new posts by email.

Join 88 other subscribers
  • Contact Us

Bioengineer.org © Copyright 2023 All Rights Reserved.

Welcome Back!

Login to your account below

Forgotten Password?

Retrieve your password

Please enter your username or email address to reset your password.

Log In
No Result
View All Result
  • Homepages
    • Home Page 1
    • Home Page 2
  • News
  • National
  • Business
  • Health
  • Lifestyle
  • Science

Bioengineer.org © Copyright 2023 All Rights Reserved.