نتایج جستجو برای: planning horizon
تعداد نتایج: 226449 فیلتر نتایج به سال:
This paper presents a multi-period inventory lot-sizing scenario, where there are multiple products and multiple suppliers. We consider a situation where the demand of multiple discrete products is known over a planning horizon. Each of these products can be sourced from a set of approved suppliers, a supplier-dependent transaction cost applying for each period in which an order is placed on a ...
W consider a newsvendor who dynamically updates her forecast of the market demand over a finite planning horizon. The forecast evolves according to the martingale model of forecast evolution (MMFE). The newsvendor can place multiple orders with increasing ordering cost over time to satisfy demand that realizes at the end of the planning horizon. In this context, we explore the trade-off between...
This technical report is an extended version of the paper ’A Receding Horizon Algorithm for Informative Path Planning with Temporal Logic Constraints’ accepted to the 2013 IEEE International Conference on Robotics and Automation (ICRA). This paper considers the problem of finding the most informative path for a sensing robot under temporal logic constraints, a richer set of constraints than hav...
A mixed-model assembly line is widely used nowadays in industry. Effectively applying mixed-model assembly can result in smooth part usage and balanced workloads on the assembly line. The problem of production planning in terms of scheduling various models on an assembly line over a time horizon is studied here. The problem assumes that each model has a given range of production days within the...
This paper follows the discounted cash flow (DCF) approach to investigate inventory replenishment problem for EOQ model with defective items taking account of time value of money. First, this paper shows that the present value of the total variable cost for the infinite planning horizon is a convex function. Second, this paper derives bounds to determine the optimal cycle time under minimum val...
This paper suggests an integrated mathematical framework developed based on the leader–followers game for augmentation of transmission networks. Transmission Network Service Provider moves first and designs the horizon year transmission system. Generating Companies compete for having the highest share from the energy market and they find their equilibrium point using the Nash equilibrium concep...
We investigate the computability of infinite-horizon partially observable Markov decision processes under discounted and undiscounted optimality criteria. The undecidability of the emptiness problem for probabilistic finite automata is used to show that a few technical problems, such as the isolation of a threshold, and closely related undiscounted problems such as probabilistic planning are un...
Generation expansion planning (GEP) in the competitive environment of electric industry is an important and complex problem, which is normally performed for about the next 10-30 years horizon. This problem has presented a challenge for both market managers and suppliers regarding the safe provision of loads and acquiring minimum profit for suppliers over the planning interval. In this paper, th...
This paper describes TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to an expressive subset of linear temporal logic (LTL) specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from LTL specifications, and (3) receding horizon planning. The underlying ...
Motor skill is usually understood as a capability to perform faster and more accurate movements than other, unskilled, individuals. In this study we investigated motor skill learning using a path tracking task, where subjects had to track various curved paths as fast as possible, in the absence of any external perturbations. We found that subjects become better with practice, producing faster a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید