An EOQ for Deteriorating Items Under Supplier Credits When Demand is Stock Dependent
An EOQ Model for a Deteriorating Item With Non-Linear Demand Under Inflation and a Trade Credit Policy
An EOQ Model With Stock Dependent Demand and Imperfect Quality Items
An EOQ model with time dependent deterioration under discounted cash flow approach when supplier credits are linked to order quantity
An EPLS Model for a Variable Production Rate With Stock-Price Sensitive Demand and Deterioration
An EPQ Model Under Cash Discount and Permissible Delay in Payments Derived Without Derivatives
An Erlang loss queue with time-phased batch arrivals as a model for traffic control in communication networks.
An exact method for solving the multi-processor flow-shop
An Exact Method for Solving the Multi-Processor Flow-Shop
The aim of this paper is to present a new branch and bound method for solving the Multi-Processor Flow-Shop. This method is based on the relaxation of the initial problem to m-machine problems corresponding to centers. Release dates and tails are associated with operations and machines. The branching scheme consists in fixing the inputs of a critical center and the lower bounds are those of the m-machine problem. Several techniques for adjusting release dates and tails have also been introduced....
An expectation maximization algorithm to model failure times by continuous-time Markov chains.
An Expert System for National Economy Model Simulation
An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
A bound for the greedy heuristic applied to the K-facility location problem can be calculated, using values gathered during the calculation of the heuristic. The bound strengthens a well-known bound for the heuristic. Computational experiments show that this bound can be beneficial when the number of facilities is small or close to the total number of potential sites. In addition, it is consistent with previous results about the influence of the data characteristics upon the optimal value.
An extended opportunity-based age replacement policy
An Extended Opportunity-Based Age Replacement Policy
The present study proposes an extended opportunity-based age replacement policy where opportunities occur according to a Poisson process. When the age, x of the system satisfies x < S for a prespecified value S, a corrective replacement is conducted if the objective system fails. In case x satisfies S ≤ x < T for another prespecified value T, we take an opportunity to preventively replace the system by a new one with probability p, and do not take the opportunity with probability 1 - p. At...
An extension of the MS pivoting rule to capacitated network flow problems
An Improved Algorithm for a Bicriteria Batching Scheduling Problem
This note is concerned with the bicriteria scheduling problem on a series-batching machine to minimize maximum cost and makespan. An O(n5) algorithm has been established previously. Here is an improved algorithm which solves the problem in O(n3) time.
An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem
Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an independent...
An improved ARED algorithm for congestion control of network transmission.
An improved method for the solution of the problem of location on an inclined plane
An inflationary inventory model with time dependent demand with Weibull distribution deterioration and partial backlogging under permissible delay in payments