We are interested in structures and efficient methods for mixed-integer nonlinear programs (MINLP) that arise from a first discretize, then optimize approach to timedependent mixed-integer optimal control problems (MIOCPs). In this study we focus on combinatorial constraints, in particular on restrictions on the number of switches on a fixed time grid. We propose a novel approach that is based ...

This paper presents a novel mixed integer linear programing (MILP) formulation for finding the optimal layout of a fixed number of identical turbines that maximizes wind farm power generation. Previous MILP formulations with power maximizing objectives discretize the feasible space by using a grid of possible turbine locations. The proposed MILP formulation takes a different approach by allowin...

Power gating is a very effective technique to reduce the subthreshold leakage by using sleep transistors to turn off the functional blocks or cells when they are not used. When the sleep transistors are turned on, the power grid may experience a huge current surge which may violate the integrity of the power grid. This paper addresses this problem by formulating the wakeup scheduling of sleep t...

Automation and flexibility are often mentioned as key concepts in modern production industry. To increase the level of flexibility, deterministic finite automata (DFA) can be used to model, specify and verify the production systems. Often, it is also desirable to optimize some production criteria, such as for example the cycle time of a manufacturing cell. In this paper, a method for automatic ...

We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and is therefore NP-complete. However, a commonly-encountered instance of this problem (m = 2) can be solved in polynomial time. For the general case (m > 2), we present a mixed-integer linear programming (MILP) model for ...

This paper presents a multi-week mixed integer linear programming (MILP) scheduling model for an ice cream processing facility. The ice cream processing is a typical complex food manufacturing process and a simplified version of this processing has been adapted to investigate scheduling problems in the literature. Most of these models only considered the production scheduling for a week. In thi...

We present optimal solutions to the test scheduling problem for core-based systems. Given a set of tasks (test sets for the cores), a set of test resources (e.g., test buses, BIST hardware) and a test access architecture, we determine start times for the tasks such that the total test application time is minimized. We show that the test scheduling decision problem is equivalent to the -processo...