Related papers: Catalytic Buffering for Optimal Scheduling of Self…
Stochastic programming can be applied to consider uncertainties in energy system optimization models for capacity expansion planning. However, these models become increasingly large and time-consuming to solve, even without considering…
We propose a simulated annealing algorithm specifically tailored to optimise total retrieval times in a multi-level warehouse under complex pre-batched picking constraints. Experiments on real data from a picker-to-parts order picking…
This paper considers single-machine scheduling problems in which a given solution, i.e. an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. The need for rescheduling may arise in different contexts,…
To double the cellular population of ribosomes, a fraction of the active ribosomes is allocated to synthesize ribosomal proteins. Subsequently, these ribosomal proteins enter the ribosome self-assembly process, synthesizing new ribosomes…
In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2…
In growing active matter systems, a large collection of engineered or living autonomous units metabolize free energy and create order at different length scales as they proliferate and migrate collectively. One such example is bacterial…
Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel and distributed platforms. It is inherently centralized. However, with the increasing number of processors, the cost for managing a single…
We present two adaptive schemes for dynamically choosing the number of parallel instances in parallel evolutionary algorithms. This includes the choice of the offspring population size in a (1+$\lambda$) EA as a special case. Our schemes…
We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms…
This paper addresses the optimization of scheduling for workers at a logistics depot using a combination of genetic algorithm and simulated annealing algorithm. The efficient scheduling of permanent and temporary workers is crucial for…
Chemotaxis receptors in E. coli form clusters at the cell poles and also laterally along the cell body, and this clustering plays an important role in signal transduction. Recently, experiments using flourrescence imaging have shown that,…
A distributed-memory parallelization strategy for the density matrix renormalization group is proposed for cases where correlation functions are required. This new strategy has substantial improvements with respect to previous works. A…
Cells can use periodic enzyme activities to adapt to periodic environments or existing internal rhythms and to establish metabolic cycles that schedule biochemical processes in time. A periodically changing allocation of the protein budget…
We introduce a simple physical picture to explain the process of molecular sorting, whereby specific proteins are concentrated and distilled into submicrometric lipid vesicles in eukaryotic cells. To this purpose, we formulate a model based…
This paper investigates the parallel complexity of several non-equilibrium growth models. Invasion percolation, Eden growth, ballistic deposition and solid-on-solid growth are all seemingly highly sequential processes that yield…
In this paper we study a proportionate flow shop of batching machines with release dates and a fixed number $m \geq 2$ of machines. The scheduling problem has so far barely received any attention in the literature, but recently its…
We propose an asynchronous iterative scheme that allows a set of interconnected nodes to distributively reach an agreement within a pre-specified bound in a finite number of steps. While this scheme could be adopted in a wide variety of…
Computations, where the number of results is much smaller than the input data and are produced through some sort of accumulation, are called Reductions. Reductions appear in many scientific applications. Usually, reductions admit an…
During batch growth on mixtures of two growth-limiting substrates, microbes consume the substrates either sequentially or simultaneously. These growth patterns are manifested in all types of bacteria and yeasts. The ubiquity of these growth…
This paper proposes a new highly scalable and asymptotically optimal control synthesis algorithm from linear temporal logic specifications, called $\text{STyLuS}^{*}$ for large-Scale optimal Temporal Logic Synthesis, that is designed to…