Abstract Process mining techniques use event data to describe business processes, where the provided insights are used for predicting processes’ future states ( Predictive Monitoring ). Remaining Time Prediction of process instances is an important task in field (PPM). Existing approaches have two key limitations developing Models (RTM): (1) The features predictions lack context, and created mo...

In this paper we provide a novel approach to characterize the order process of an (s, S) and an (r, nQ) inventory policy. These inventory policies are commonly used when a fixed order cost is present. We provide two distinct perspectives. First, we analyze the time between subsequent replenishments, as well as the size of the replenishment orders, and characterize the distribution of both. Seco...

We consider a batch scheduling problem in which the processing time of a batch of jobs equals the maximum of the processing times of all jobs in the batch. This is the case, for example, for burn-in operations in semiconductor manufacturing, and other testing operations. Processing times are assumed to be random, and we consider minimizing the makespan and the flowtime. The problem is much more...

We consider the problem of partitioning interval graphs into cliques of bounded size. Each interval has a weight, and the cost of a clique is the maximum weight of any interval in the clique. This natural graph problem can be interpreted as a batch scheduling problem. Solving an open question from [7, 4, 5], we show NP-hardness, even if the bound on the clique sizes is constant. Moreover, we gi...

depression disorders are associated with serious dysfunction and depressive symptoms. cognitive slowing is a clear symptom observed in all depressed people. pvsat is a measure of cognitive function that specifically assesses visual information processing speed and flexibility, as well as calculation ability. the aim of the present study was to determine whether the paced visual serial addition ...

researchers of csiro land and water in griffith in australia have found a way to repeatedly reuse drainage water to grow crops. in the process the system will concentrate the salt in the water to a manageable level which can then be used or stored in an environmentally friendly manner. the process, known as sequential biological concentration, is based on a novel system for land, based treatmen...

Some scheduling problems, including the Travelling Salesman Problem (TSP), have a “big valley” search landscape: the best solutions have common building blocks, so crossover works well. Unfortunately, in a realistic single-machine problem (TSP with batching, sequence-dependent setups, and multi-level precedence constraints) the best solutions have little in common. A mutation-only approach

In this work we introduce a Genetic Algorithm (GA) for the Order Batching Problem considering traversal and return routing policies. The proposed GA has been tested on randomly generated instances and compared with the wellknown savings algorithm. According to our extensive computational experiments we can say that the proposed GA yields promising solutions in acceptable computation times.