Results 61 to 70 of about 22,096 (146)

A New Hybrid Social Spider Optimization and Tabu Search for the Permutation Flow Shop Scheduling Problem

Journal of Electrical and Computer Engineering, Volume 2026, Issue 1, 2026.
The permutation flow shop scheduling problem (PFSP) is an NP‐complete problem that represents a significant challenge in manufacturing and production environments. Memetic algorithms (MAs) that hybridize global search strategies with local refinement techniques are widely regarded as among the most powerful metaheuristic approaches for addressing ...
Mohamed Kurdi, Toufik Mzili, Ahmad Steef, Momina Shaheen, Ayman Al-Quraan   +4 more
wiley   +1 more source

Proportionally Fair Makespan Approximation

Proceedings of the AAAI Conference on Artificial Intelligence
We 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, Garg, Jugal, Narayan, Vishnu V., Ponitka, Tomasz   +3 more
openaire   +2 more sources

Minimum‐Peak‐Cost Flows Over Time

Networks, Volume 86, Issue 4, Page 389-401, December 2025.
ABSTRACT Peak cost is a novel objective for flows over time that describes the amount of workforce necessary to run a system. We focus on minimizing peak costs in the context of maximum temporally repeated flows and formulate the corresponding MPC‐MTRF problem.
Mariia Anapolska, Emma Ahrens, Christina Büsing, Felix Engelhardt, Timo Gersing, Corinna Mathwieser, Sabrina Schmitz, Sophia Wrede   +7 more
wiley   +1 more source

Portable PGAS‐Based GPU‐Accelerated Branch‐And‐Bound Algorithms at Scale

Concurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.
ABSTRACT The Branch‐and‐Bound (B&B) technique plays a key role in solving many combinatorial optimization problems, enabling efficient problem‐solving and decision‐making in a wide range of applications. It incrementally constructs a tree by building candidates to the solutions and abandoning a candidate as soon as it determines that it cannot lead to ...
Guillaume Helbecque, Ezhilmathi Krishnasamy, Tiago Carneiro, Nouredine Melab, Pascal Bouvry   +4 more
wiley   +1 more source

A hyper-heuristic for adaptive scheduling in computational grids [PDF]

, 2007
In this paper we present the design and implementation of an hyper-heuristic for efficiently scheduling independent jobs in computational grids.
Xhafa Xhafa, Fatos
core   +1 more source

Makespan Minimization in Job Shop Scheduling

International Journal of Engineering and Management Research, 2021
In industries, the completion time of job problems in the manufacturing unit has risen significantly. In several types of current study, the job's completion time, or makespan, is reduced by taking straight paths, which is time-consuming. In this paper, we used an Improved Ant Colony Optimization and Tabu Search (ACOTS) algorithm to solve this problem ...
openaire   +3 more sources

Makespan Trade-offs for Visiting Triangle Edges

Discrete Mathematics & Theoretical Computer Science
We study a primitive vehicle routing-type problem in which a fleet of $n$unit speed robots start from a point within a non-obtuse triangle $\Delta$, where $n \in \{1,2,3\}$. The goal is to design robots' trajectories so as to visit all edges of the triangle with the smallest visitation time makespan.
Konstantinos Georgiou, Somnath Kundu, Pawel Pralat   +2 more
openaire   +4 more sources

Scheduling under Uncertainty: Bounding the Makespan Distribution [PDF]

, 2001
Deterministic models for project scheduling and control suffer from the fact that they assume complete information and neglect random influences that occur during project execution. A typical consequence is the underestimation of the expected project duration and cost frequently observed in practice.
openaire   +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

Online Makespan Scheduling under Scenarios

We consider a natural extension of online makespan scheduling on identical parallel machines by introducing scenarios. A scenario is a subset of jobs, and the task of our problem is to find a global assignment of the jobs to machines so that the maximum makespan under a scenario, i.e., the maximum makespan of any schedule restricted to a scenario, is ...
openaire   +3 more sources