Many applications involve a set of prediction tasks that must be accomplished sequentially through user interaction. If the tasks are interdependent, the order in which they are performed may have a significant impact on the overall performance of the prediction systems. However, manual specification of an optimal order may be difficult when the interdependencies are complex, especially if the ...

In this paper, we discuss a paper of Chang and Teng [C.T. Chang, J.T. Teng, Retailer’s optimal ordering policy under supplier 4 credits, Mathematical Methods of Operations Research 60 (2004) 471–483], they established an inventory model for deteriorating 5 items when the supplier permits not only a cash discount but also a permissible delay. They also proved a closed-form solution 6 of the inve...

Background: The purpose of this study was to evaluate nodal irradiation with conventional three-field's technique. Materials and Methods: Fifty patients with breast cancer were enrolled in this study. Computed tomography scans in the supine treatment position were imported into a treatment planning system. Levels I-III axillary and supraclavicular nodes were identified and their depths to the a...

A rule-based program will return a set of answers to each query. An impure program , which includes the Prolog cut \!" and \not()" operators, can return diierent answers if its rules are reordered. There are also many reasoning systems that return only the rst answer found for each query; these rst answers, too, depend on the rule order, even in pure rule-based systems. A theory revision algori...

for sorting n integers from the range !!.) algorithm p Optimal cost parallel algorithms for lexicographical ordering on a CREW PRAM are log n presented here. An 0 (I ( ) og nIp {I•...• n} usingp :::;; n processors is given here. Also an algorithm for sorting n strings of size lover an alphabet of size s is presented. that requires 0 ( log n[ ) .!!!.. + !.... ) units of time log (nllp p p and it...

A firm receives orders that will be required at an uncertain time given by an Erlang distribution, and over time observes the associated independent exponential events. The firm, in turn, places orders at a linear cost from a supplier with fixed lead time l and has the option of converting (expediting) each order, at a cost, over a certain time interval after the order is originally placed. A c...

This electronic file may not be altered in any way. The author(s) of this article is/are permitted to use this PDF file to generate printed copies to be used by way of offprints, for their personal use only. Permission is granted by the publishers to post this file on a closed server which is accessible to members (students and staff) only of the author’s/s’ institute, it is not permitted to po...

In conventional inventory management, the retailers monitor their own inventory levels and place orders at the distributor when they think it is the appropriate time to reorder. The distributor receives these orders from the retailers, prepares the product for delivery. Similarly, the distributor will place an order at the manufacturer at the

In this paper we introduce the optimal solution for a simple and yet practical inventory policy with the important characteristic which eliminates the uncertainty in demand for suppliers. In this new policy which is different from the classical inventory policies, the time interval between any two consecutive orders is fixed and the quantity of each order is one. Assuming the fixed ordering cos...