<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="5.3.1" xmlns="http://www.crossref.org/schema/5.3.1" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schema/deposit/crossref5.3.1.xsd">
 <head>
  <doi_batch_id>aspg-21-4277-1791465328</doi_batch_id>
  <timestamp>20261008131528</timestamp>
  <depositor>
   <depositor_name>American Scientific Publishing Group</depositor_name>
   <email_address>admin@americaspg.com</email_address>
  </depositor>
  <registrant>American Scientific Publishing Group</registrant>
 </head>
 <body>
  <journal>
   <journal_metadata language="en">
    <full_title>International Journal of Neutrosophic Science</full_title>
    <abbrev_title>IJNS</abbrev_title>
    <issn media_type="print">2692-6148</issn>
    <issn media_type="electronic">2690-6805</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2026</year>
    </publication_date>
    <journal_volume>
     <volume>27</volume>
    </journal_volume>
    <issue>2</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>Energy-Efficient and Sustainable Computing Using Mathematical Optimization</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>Abdulnaser</given_name>
      <surname>Rashid</surname>
      <affiliations>
       <institution>
        <institution_name>Department of Computer Science, College of Computer, Qassim University, Buraydah 51452, Saudi Arabia</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>Energy consumption in large-scale distributed computing has become a first-order design constraint, affecting operational costs, carbon emissions, and service reliability. This paper proposes a hybrid optimization framework that combines Linear Programming (LP) for feasible solution seeding with a Hybrid Genetic–Simulated Annealing (HGSA) metaheuristic for global search. The objective is to minimize total energy while preserving Quality of Service (QoS) and Service-Level Agreement (SLA) constraints. We adopt a widely used server power model that relates power to utilization and extend it with an optional carbon-aware objective that weights power by time- and location-varying grid carbon intensity. Decision variables include task–node–time assignments and, optionally, per-host frequency states for dynamic voltage and frequency scaling (DVFS). The proposed HGSA leverages LP-based seeding to accelerate convergence, applies crossover and mutation operators to explore the search space, and uses simulated annealing to refine solutions and escape local optima. We evaluate the approach using Google Cluster traces and CloudSim Plus, reporting standard metrics such as total energy (kWh), carbon emissions (kgCO₂e) when applicable, SLA violations (%), and makespan. A percentage-reduction indicator quantifies improvements over baselines (e.g., Round Robin and First-Fit). The framework is designed to be reproducible and extensible, with an experimental template specifying workload preprocessing, simulator configuration, and evaluation protocols. Results demonstrate consistent reductions in energy alongside improved utilization balancing, while respecting SLA constraints; when carbon-aware weighting is enabled, the scheduler further shifts flexible work to cleaner intervals without compromising throughput. The contributions include: (i) a unified energy/carbon objective with explicit constraints; (ii) an LP-seeded HGSA tailored to task scheduling; (iii) a dataset-driven evaluation recipe using realistic traces; and (iv) a practical measurement protocol that reports both absolute values and percentage reductions to facilitate cross-study comparison.</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2026</year>
    </publication_date>
    <pages>
     <first_page>504</first_page>
     <last_page>510</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">4277</item_number>
    </publisher_item>
    <ai:program name="AccessIndicators">
     <ai:license_ref applies_to="vor">https://creativecommons.org/licenses/by/4.0/</ai:license_ref>
    </ai:program>
    <doi_data>
     <doi>10.54216/IJNS.270241</doi>
     <resource>https://www.americaspg.com/journal/21/article/4277</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://www.americaspg.com/storage/21770767021.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
