Results 81 to 90 of about 14,397 (225)
International Transactions in Operational Research, Volume 33, Issue 2, Page 860-891, March 2026.Abstract Sustainability has become one of the main objectives in all human activities and, in particular, in manufacturing environments. In this paper, we consider the flexible job shop scheduling problem with the objective of minimizing energy consumption.
Ernesto G. Birgin +2 more
wiley +1 more source
Local Optima Networks for the Permutation Flowshop Scheduling Problem: Makespan vs. Total Flow Time [PDF]
, 2017 Local Optima Networks were proposed to understand the structure of combinatorial landscapes at a coarse-grained level. We consider a compressed variant of such networks with features that are meaningful for the study of search difficulty in the context ...
Daolio, Fabio +8 more
core +1 more source
Dynamic flexible job shop scheduling using greedy actor–neural critic PPO reinforcement learning algorithm [PDF]
Journal of Project ManagementDynamic Flexible Job Shop Scheduling (DFJSS) is a critical challenge in smart manufacturing due to dynamic job arrivals, machine breakdowns, routing flexibility, and multi-objective performance requirements.
Selva Kumar Chandrasekar +3 more
doaj +1 more source
Stall‐Free Asynchronous State Repartitioning With a Proactive Workload Tracking Window
Concurrency and Computation: Practice and Experience, Volume 38, Issue 3, February 2026.ABSTRACT High‐throughput stateful applications rely on dynamic data repartitioning to adapt to changing workloads, but this process presents significant challenges. This paper provides a detailed analysis of such challenges, drilling down into the tradeoffs between adaptation, computational overhead, and service availability. We identify that a primary
Douglas Pereira Luiz +1 more
wiley +1 more source
Railway scheduling reduces the expected project makespan. [PDF]
The Critical Chain Scheduling and Buffer Management (CC/BM) methodology, proposed by Goldratt (1997), introduced the concepts of feeding buffers, project buffers and resource buffers as well as the roadrunner mentality.
Demeulemeester, Erik, Tian, Wendi
core
Performance Improvement Rate (%) on Makespan.
, 2016 Performance Improvement Rate (%) on Makespan.
Gaddafi Abdul-Salaam (3158541) +3 more
core +1 more source
Exponential Size Neighborhoods for Makespan Minimization Scheduling [PDF]
, 2011 We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be ...
Brüggemann, T. +7 more
core +1 more source
Concurrency and Computation: Practice and Experience, Volume 38, Issue 3, February 2026.ABSTRACT Task‐based programming interfaces introduce a paradigm in which computations are decomposed into fine‐grained units of work known as “tasks”. StarPU is a runtime system originally developed to support task‐based parallelism on on‐premise heterogeneous architectures by abstracting low‐level hardware details and efficiently managing resource ...
Vanderlei Munhoz +5 more
wiley +1 more source
Heuristics for the Logistic Order-Picking Problem with One-Directional Conveyor and Buffers
Applied SciencesOrder picking is one of the most time-consuming and cost-intensive operations in distribution centers, particularly when material flow is constrained by fixed transport infrastructure.
Kateryna Czerniachowska +1 more
doaj +1 more source
Local search performance guarantees for restricted related parallel machine scheduling [PDF]
We consider the problem of minimizing the makespan on restricted related parallel machines. In restricted machine scheduling each job is only allowed to be scheduled on a subset of machines. We study the worst-case behavior of local search algorithms. In
Recalde Diego +3 more
core