Search
Search Results
-
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
We consider scheduling monotonic moldable tasks on multiple platforms, where each platform contains a set of processors. A moldable task can be split...
-
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
In this paper we consider the coupled task scheduling problem with exact delay times on a single machine with the objective of minimizing the total...
-
Exact and approximation algorithms for covering timeline in temporal graphs
We consider a variant of vertex cover on temporal graphs that has been recently defined for summarization of timeline activities in temporal graphs....
-
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
We consider bicriteria flowshop scheduling problems with two machines to simultaneously minimize the makespan and the total completion time without...
-
Fast Heuristics and Approximation Algorithms
This chapter discusses theoretical analysis of approximation algorithms for QUBO and the Ising QUBO. We point out that the standard performance...
-
Approximation algorithms for batch scheduling with processing set restrictions
We consider batch scheduling on m machines to minimize the makespan. Each job has a given set of machines to be assigned. Each machine can process...
-
Quadratic approximation salp swarm algorithm for function optimization
The Salp Swarm Algorithm (SSA) is a peculiar swarm-based algorithm that is extensively used for solving numerous real-world problems due to its...
-
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times
We study two scheduling problems in a proportionate flow shop environment, where job processing times are machine independent. In contrast to...
-
Approximation algorithms for some min–max postmen cover problems
We investigate two min–max k -postmen cover problems. The first is the Min–Max Rural Postmen Cover Problem (RPC), in which we are given an undirected...
-
-
Approximation of multistage stochastic programming problems by smoothed quantization
We present an approximation technique for solving multistage stochastic programming problems with an underlying Markov stochastic process. This...
-
Algorithms for Scheduling Deadline-Sensitive Malleable Tasks
Due to the ubiquity of batch data processing, the related problems of scheduling malleable batch tasks have received significant attention. We...
-
An introduction to variational quantum algorithms for combinatorial optimization problems
Noisy intermediate-scale quantum computers (NISQ computers) are now readily available, motivating many researchers to experiment with Variational...
-
Two linear approximation algorithms for convex mixed integer nonlinear programming
We present two new algorithms for convex Mixed Integer Nonlinear Programming (MINLP), both based on the well known Extended Cutting Plane (ECP)...
-
gym-flp: A Python Package for Training Reinforcement Learning Algorithms on Facility Layout Problems
Reinforcement learning (RL) algorithms have proven to be useful tools for combinatorial optimisation. However, they are still underutilised in...
-
Model-Independent Error Bound Estimation for Conformance Checking Approximation
Conformance checking techniques quantify correspondence between a process’s execution and a reference process model using event data. Alignments,...
-
A sample average approximation-based heuristic for the stochastic production routing problem
The Production Routing Problem under demand uncertainty is an integrated problem containing production, inventory, and distribution decisions. At the...
-
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops
We investigate the seemingly untouched yet the most general parallel identical k -stage flow-shops scheduling, in which we are given an arbitrary...
-
An improved approximation algorithm for a scheduling problem with transporter coordination
We study the following scheduling problem with transportation. Given a set of n jobs that need to be processed on a single machine, we need to...
-
A novel machine learning algorithm for interval systems approximation based on artificial neural network
In recent years, order-reduction techniques based on artificial intelligence algorithms have become a topic of interest in the structural dynamics...
