A constraint propagation (filtering) turned out to be an efficient method how to reduce search space for backtrack-based algorithms. This paper brings several improvements of filtering methods for batch processing with sequence dependent setup times. The first one is domain filtering based on a precedence graph—such filtering can be useful even when no precedences are given at the start. I desc...

The single-machine early/tardy (E/T) scheduling problem is addressed in this research. The objective of this problem is to minimize the total amount of earliness and tardiness. Earliness and tardiness are weighted equally and the due date is common and large (unrestricted) for all jobs. Machine setup time is included and is considered sequence-dependent. When sequence-dependent setup times are ...

in this paper, optimal distributed control of the time-dependent navier-stokes equations is considered. the control problem involves the minimization of a measure of the distance between the velocity field and a given target velocity field. a mixed numerical method involving a quasi-newton algorithm, a novel calculation of the gradients and an inhomogeneous navier-stokes solver, to find the opt...

Order acceptance and scheduling decisions arise when the limited production capacity entails a manufacturer to select among incoming orders. In this paper, we consider an order acceptance and scheduling problem in a single machine environment where the orders are processed without preemption and a sequence dependent setup time is incurred between processing of every consecutive order. The probl...

We explore thermoelectric spin transport and spin dependent phenomena in a noncollinear quantum dot spin valve setup. Using this setup, we demonstrate the possibility of a thermoelectric excitation of single spin dynamics inside the quantum dot. Many-body exchange fields generated on the single spins in this setup manifest as effective magnetic fields acting on the net spin accumulation in the ...