Results 71 to 80 of about 25,495 (197)

Non-Preemptive Scheduling on Machines with Setup Times

, 2015
Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type.
A Allahverdi, CL Monma, CN Potts, DS Hochbaum, E Horowitz, EC Xavier, EC Xavier, H Shachnai, JR Correa, N Alon, S Divakaran   +10 more
core   +1 more source

A New Formulation for the Traveling Salesman Problem With Drone and Lockers

Networks, Volume 86, Issue 2, Page 112-143, September 2025.
ABSTRACT Nowadays, driven by factors such as the rapid growth of online sales, different delivery methods are being explored to improve last‐mile logistics processes. Among these, the combined use of trucks and drones and the option of utilizing parcel lockers as an alternative to home delivery have led to the definition of new optimization problems ...
Danilo Amitrano, Maurizio Boccia, Adriano Masone, Claudio Sterle   +3 more
wiley   +1 more source

Scheduling Monotone Moldable Jobs in Linear Time

, 2018
A moldable job is a job that can be executed on an arbitrary number of processors, and whose processing time depends on the number of processors allotted to it.
Jansen, Klaus, Land, Felix
core   +1 more source

Picking Operations in Warehouses With Dynamically Arriving Orders: How Good is Reoptimization?

Networks, Volume 86, Issue 2, Page 157-173, September 2025.
ABSTRACT E‐commerce operations are essentially online, with customer orders arriving dynamically. However, very little is known about the performance of online policies for warehousing with respect to optimality, particularly for order picking and batching operations, which constitute a substantial portion of the total operating costs in warehouses. We
Catherine Lorenz, Alena Otto, Michel Gendreau   +2 more
wiley   +1 more source

Makespan minimization with OR-precedence constraints [PDF]

, 2021
Felix Happach
openalex   +1 more source

CO2 Storage Site Selection: A Comprehensive Review of Current Approaches

Greenhouse Gases: Science and Technology, Volume 15, Issue 4, Page 487-510, August 2025.
ABSTRACT Global warming, driven by increasing anthropogenic greenhouse gas emissions, has emerged as a critical environmental concern. Carbon capture and storage (CCS) technology offers a promising solution for reducing CO2 emissions, but its effectiveness depends on identifying suitable candidates that can ensure safe, long‐term storage of CO2.
Shahryar Rashidi, Seyed Shariatipour, Mohammadreza Bagheri   +2 more
wiley   +1 more source

Energy Efficient VM Selection Using CSOA‐VM Model in Cloud Data Centers

CAAI Transactions on Intelligence Technology, Volume 10, Issue 4, Page 1217-1234, August 2025.
ABSTRACT The cloud data centres evolved with an issue of energy management due to the constant increase in size, complexity and enormous consumption of energy. Energy management is a challenging issue that is critical in cloud data centres and an important concern of research for many researchers.
Mandeep Singh Devgan, Tajinder Kumar, Purushottam Sharma, Xiaochun Cheng, Shashi Bhushan, Vishal Garg   +5 more
wiley   +1 more source

An Efficient Task Scheduling for Cloud Computing Platforms Using Energy Management Algorithm: A Comparative Analysis of Workflow Execution Time

IEEE Access
Cloud computing platform offers numerous applications and resources such as data storage, databases, and network building. However, efficient task scheduling is crucial for maximizing the overall execution time.
Adeel Ahmed, Muhammad Adnan, Saima Abdullah, Israr Ahmad, Nazik Alturki, Leila Jamel   +5 more
doaj   +1 more source

CloudSim 7G: An Integrated Toolkit for Modeling and Simulation of Future Generation Cloud Computing Environments

Software: Practice and Experience, Volume 55, Issue 6, Page 1041-1058, June 2025.
ABSTRACT Background Cloud Computing has established itself as an efficient and cost‐effective paradigm for the execution of web‐based applications, and scientific workloads, that need elasticity and on‐demand scalability capabilities. However, the evaluation of novel resource provisioning and management techniques is a major challenge due to the ...
Remo Andreoli, Jie Zhao, Tommaso Cucinotta, Rajkumar Buyya   +3 more
wiley   +1 more source

A Review of Benchmark and Test Functions for Global Optimization Algorithms and Metaheuristics

WIREs Computational Statistics, Volume 17, Issue 2, June 2025.
ABSTRACT Benchmarking in optimization is a critical step in evaluating the performance, robustness, and scalability of machine learning algorithms and metaheuristics. While trends in benchmark design continue to evolve, synthetic functions remain vital for fundamental stress tests and theoretical evaluations.
M. Z. Naser, Mohammad Khaled Al‐Bashiti, Arash Teymori Gharah Tapeh, Ahmad Naser, Venkatesh Kodur, Rami Hawileh, Jamal Abdalla, Nima Khodadadi, Amir H. Gandomi, Armin Dadras Eslamlou   +9 more
wiley   +1 more source