In this study, we consider the stochastic capacitated lot sizing problem with controllable processing times where processing times can be reduced in return for extra compression cost. We assume that the compression cost function is a convex function as it may reflect increasing marginal costs of larger reductions and may be more appropriate when the resource life, energy consumption or carbon e...

In this study, we determine the upper and lower bounds for the processing time of each job under controllable machining conditions. The proposed bounding scheme is used to find a set of discrete efficient points on the efficient frontier for a bi-criteria scheduling problem on a single CNC machine. We have two objectives; minimizing the manufacturing cost (comprised of machining and tooling cos...

a new anti-lock braking system (abs) for motorcycles is proposed in this study. it functions by processing the speed of the motorcycle tire in contact with the ground relative to the speed of the motorcycle itself and by calculating the slip ratio (λ) of the tire slipping on the ground while braking, and reducing it to a minimum which leads to increased controllability of the motorcycle and red...

We study scheduling problems with controllable processing times on parallel machines, in which the decision-maker selects an actual processing time for each job from a given interval. The chosen values of the processing times must be such that each job can be preemptively scheduled within a given time interval, and it is required to minimize a certain cost function that depends on the chosen ti...

workspace analysis is one of the most important issues in the robotic parallel manipulator design. ‎however, ‎the unidirectional constraint imposed by cables causes this analysis more challenging in the cabledriven redundant parallel manipulators. controllable workspace is one of the general workspace in the cabledriven redundant parallel manipulators due to the dependency on geometry parameter...

Graph-based approaches for sequencing motion capture data have produced some of the most realistic and controllable character motion to date. Most previous graph-based approaches have employed a run-time global search to find paths through the motion graph that meet user-defined constraints such as a desired locomotion path. Such searches do not scale well to large numbers of characters. In thi...