Results 81 to 90 of about 22,962 (193)
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 +3 more
wiley +1 more source
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 +10 more
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 +2 more
wiley +1 more source
Special cases of online parallel job scheduling [PDF]
, 2007 In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, where the next job becomes known as soon as the current job is scheduled ...
Hurink, Johann L., Paulus, Jacob Jan
core +3 more sources
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
, 2011 We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job $j$ has a length $l_{j}$ and each machine $i$ has a private speed $t_{i}$.
Fleischer, Lisa, Wang, Zhenghui
core +2 more sources
Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation
Applied Sciences, 2020 Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy.
Xuelian Pang +4 more
doaj +1 more source
Proportionally Fair Makespan Approximation
Proceedings of the AAAI Conference on Artificial IntelligenceWe study fair mechanisms for the classic job scheduling problem on unrelated machines with the objective of minimizing the makespan. This problem is equivalent to minimizing the egalitarian social cost in the fair division of chores. The two prevalent fairness notions in the fair division literature are envy-freeness and proportionality. Prior work has
Feldman, Michal +3 more
openaire +2 more sources
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 +2 more
wiley +1 more source
Jurnal Teknik Industri, 2012 A new evolutionary computation algorithm, Superbug algorithm, which simulates evolution of bacteria in a culture, is proposed. The algorithm is developed for solving large scale optimization problems such as scheduling, transportation and assignment ...
Chandramouli Anandaraman +2 more
doaj
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 +5 more
wiley +1 more source