Results 51 to 60 of about 25,495 (197)
Time‐ and Behaviour‐Preserving Execution of Determinate Supervisory Control
IET Cyber-Physical Systems: Theory &Applications, Volume 11, Issue 1, January/December 2026.The activity framework is a model‐based framework incorporating a model of activities with determinate timing and behaviour, and a strong mathematical foundation based on max‐plus algebra that allows efficient timing analysis and optimisation of CPS. Preserving the specified behaviour and the model‐predicted timing in an implementation is challenging ...
Alireza Mohamadkhani +3 more
wiley +1 more source
Tabu Search Algorithm Based on Lower Bound and Exact Algorithm Solutions for Minimizing the Makespan in Non-Identical Parallel Machines Scheduling [PDF]
, 2021 Mohammed A. Noman +3 more
openalex +1 more source
A deterministic truthful PTAS for scheduling related machines
, 2009 Scheduling on related machines ($Q||C_{\max}$) is one of the most important problems in the field of Algorithmic Mechanism Design. Each machine is controlled by a selfish agent and her valuation can be expressed via a single parameter, her {\em speed ...
Christodoulou, George, Kovacs, Annamaria
core +2 more sources
A simheuristic algorithm for solving an integrated resource allocation and scheduling problem [PDF]
, 2019 Modern companies have to face challenging configuration issues in their manufacturing chains. One of these challenges is related to the integrated allocation and scheduling of resources such as machines, workers, energy, etc.
Ferone, Daniele +4 more
core +1 more source
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 +7 more
wiley +1 more source
Applied SciencesWith the development of Industry 4.0, discrete manufacturing systems are accelerating their transformation toward flexibility and intelligence to meet the market demand for various products and small-batch production.
Dekun Wang +6 more
doaj +1 more source
Bio-Inspired Workflow Scheduling on HPC Platforms
Tehnički Glasnik, 2021 Efficient scheduling of tasks in workflows of cloud or grid applications is a key to achieving better utilization of resources as well as timely completion of the user jobs. Many scientific applications comprise several tasks that are dependent in nature
Mandeep Kaur, Sanjay Kadam
doaj
A Simple and Effective Approach for Tackling the Permutation Flow Shop Scheduling Problem
Mathematics, 2021 In this research, a new approach for tackling the permutation flow shop scheduling problem (PFSSP) is proposed. This algorithm is based on the steps of the elitism continuous genetic algorithm improved by two strategies and used the largest rank value ...
Mohamed Abdel-Basset +4 more
doaj +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 +4 more
wiley +1 more source
AIMS MathematicsIn this study, the distributed flexible assembly permutation flowshop scheduling problem (DFAPFSP) with sequence-dependent setup times and makespan criterion was investigated.
Yuan-Zhen Li, Lei-Lei Meng, Biao Zhang
doaj +1 more source