regarding the importance sizing and grading crop in the market and other processing operations, in this study, a machine for hazelnut sizing designed, constructed and evaluated. the machine based on sizing mechanism of diverged belt. the sizing unit has a structure similar to a horizontal belt conveyor. the distance between the ropes at the entrance of the product (the end of the driven roller)...

This study proposes a gradient-free approach to integrated circuit sizing that takes into account the statistical variations of device parameters and ranges of operating conditions. A novel gradient-free algorithm for solving the worst-case performance problem is proposed. The proposed algorithm produces corners that are used in the optimisation loop of the circuit sizing process. The set of co...

We present eecient, optimal algorithms for timing optimization by discrete wire sizing and buuer insertion. Our algorithms are able to minimize a cost function subject to given timing constraints; we focus on minimization of dynamic power dissipation, but the algorithm is also easily adaptable to, for example, area minimization. In addition, the algorithm eeciently computes the complete, optima...

Delay of VLSI circuit components can be controlled by varying their sizes. In other words, performance of VLSI circuits can be optimized by changing the sizes of the circuit components. In this paper, we define a special type of geometric program called unary geometric program. We show that under the Elmore delay model, several commonly used formulations of the circuit component sizing problem ...

We propose a new algorithm to solve lot sizing, tool allocation and machining conditions optimization problems simultaneously to minimize total production cost in a CNC environment. Most of the existing lot sizing and tool management methods solve these problems independently using a two-level optimization approach. Thus, we not only improve the overall solution by exploiting the interactions a...

In this paper we propose exact solution methods for a bilevel uncapacitated lot-sizing problem with backlogs. This is an extension of the classical uncapacitated lot-sizing problem with backlogs, in which two autonomous and self-interested decision makers constitute a twoechelon supply chain. The leader buys items from the follower in order to meet external demand at lowest cost. The follower a...