Related papers: Flow Shop Scheduling with Inter-Stage Flexibility …
In the scheduling with non-uniform communication delay problem, the input is a set of jobs with precedence constraints. Associated with every precedence constraint between a pair of jobs is a communication delay, the time duration the…
We derive a new parallel-in-time approach for solving large-scale optimization problems constrained by time-dependent partial differential equations arising from fluid dynamics. The solver involves the use of a block circulant approximation…
This research investigates a multi-product capacitated lot-sizing and scheduling problem incorporating a novel learning effect, namely the period-based learning effect. This is inspired by a real case in a core analysis laboratory under a…
We address the problem of scheduling jobs with non-identical sizes and distinct processing times on a single batch processing machine, aiming at minimizing the makespan. The extensive literature on this NP-hard problem mostly focuses on…
Scheduling problems are fundamental in combinatorial optimization. Much work has been done on approximation algorithms for NP-hard cases, but relatively little is known about exact solutions when some part of the input is a fixed parameter.…
This article presents an overview of a research study of a crucial optimization problem in the Computer Science/Operations research field: The Job-shop Scheduling Problem (JSP). The JSP is a challenging task in which a set of operations…
This paper addresses the two-stocking locations single item non-stationary stochastic lot-sizing problem. The inventory level at each location is reviewed periodically. Items can be reordered and received from a common central warehouse and…
The NP-hard scheduling problem P||C_max encompasses a set of tasks with known execution time which must be mapped to a set of identical machines such that the overall completion time is minimized. In this work, we improve existing…
We study the warehouse problem, arising in the area of inventory management and production planning. Here, a merchant wants to decide an optimal trading policy that computes quantities of a single commodity to purchase, store and sell…
We study an assembly line balancing problem that occurs in sheltered worker centers for the disabled, where workers with very different characteristics are present. We are interested in the situation in which parallel assembly lines are…
This paper presents an approach for designing software for dynamical systems simulation. An algorithm is proposed to obtain a schedule for calculating each phase variable of a stiff system of differential equations. The problem is…
The problem of scheduling non-simultaneously released jobs with due dates on a single machine with the objective to minimize the maximum job lateness is known to be strongly NP-hard. Here we consider an extended model in which the…
The present paper deals with the problem of improving the efficiency of large scale turbulent flow simulations. The high-fidelity methods for modelling turbulent flows become available for a wider range of applications thanks to the…
We consider the multi-item inventory lot-sizing problem with supplier selection. The problem consists of determining an optimal purchasing plan in order to satisfy dynamic deterministic demands for multiple items over a finite planning…
In this work, we use the matrix formulation of the Permutation Flowshop Scheduling Problem with makespan minimization to derive an upper bound and a general framework for obtaining lower bounds. The proposed framework involves solving a…
Modern semiconductor manufacturing involves intricate production processes consisting of hundreds of operations, which can take several months from lot release to completion. The high-tech machines used in these processes are diverse,…
The Job-shop Scheduling Problem (JSP) is a well-known and challenging combinatorial optimization problem in which tasks sharing a machine are to be arranged in a sequence such that encompassing jobs can be completed as early as possible. In…
In the paper, the new approach to the scheduling problem are described. The approach deals with the problem of planning the cyclic production and proposes to consider such scheduling problem as the cyclic job-shop problem of the order k,…
We study a natural variant of scheduling that we call \emph{partial scheduling}: In this variant an instance of a scheduling problem along with an integer $k$ is given and one seeks an optimal schedule where not all, but only $k$ jobs, have…
When scheduling quantum operations, a shorter overall execution time of the resulting schedule yields a better throughput and higher fidelity output. In this paper, we demonstrate that quantum operation scheduling can be interpreted as a…