The joint determination of price, quality, and capacity: An application to supermarket operations.
The labeling method on two-dimensional networks
The logistic decision making in management accounting with genetic algorithms and fuzzy sets.
The logistics problems in business environments deal with assignation from a number of sources to a number of destinations. Each source offers amounts of goods, while each destination demands quantities of these goods. The object is to find the cheapest transporting schedule that satisfies the demand without violating supply restraints. In this paper we propose to use Fuzzy Sets to represent the previsional information related to costs, demands and other variables. Moreover, we suggest including...
The Lorenz transform approach to the optimal repair-cost limit replacement policy with imperfect repair
In this paper, we consider a repair-cost limit replacement problem with imperfect repair and develop a graphical method to determine the optimal repair-cost limit which minimizes the expected cost per unit time in the steady-state, using the Lorenz transform of the underlying repair-cost distribution function. The method proposed can be applied to an estimation problem of the optimal repair-cost limit from empirical repair-cost data. Numerical examples are devoted to examine asymptotic properties...
The Lorenz Transform approach to the Optimal Repair-Cost limit remplacement Policy with Imperfect Repair
In this paper, we consider a repair-cost limit replacement problem with imperfect repair and develop a graphical method to determine the optimal repair-cost limit which minimizes the expected cost per unit time in the steady-state, using the Lorenz transform of the underlying repair-cost distribution function. The method proposed can be applied to an estimation problem of the optimal repair-cost limit from empirical repair-cost data. Numerical examples are devoted to examine asymptotic properties...
The , queue with preemptive priority.
The queue with queue length dependent service times.
The maximum capacity shortest path problem : generation of efficient solution sets
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum Capacity Shortest...
The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum Capacity...
The M/G/1 retrial queue: an information theoretic approach.
In this paper, we give a survey of the use of information theoretic techniques for the estimation of the main performance characteristics of the M/G/1 retrial queue. We focus on the limiting distribution of the system state, the length of a busy period and the waiting time. Numerical examples are given to illustrate the accuracy of the maximum entropy estimations when they are compared versus the classical solutions.
The modelling and simulation method in computer aided cooperation
The Multicriteria Method for Environmentally Oriented Business Decision-Making
The MX/M/1 queue with working breakdown
In this paper, we consider a batch arrival MX/M/1 queue model with working breakdown. The server may be subject to a service breakdown when it is busy, rather than completely stoping service, it will decrease its service rate. For this model, we analyze a two-dimensional Markov chain and give its quasi upper triangle transition probability matrix. Under the system stability condition, we derive the probability generating function (PGF) of the stationary queue length, and then obtain its stochastic...
The nonlinear complementarity model of industrial symbiosis network equilibrium problem
In this paper, we propose an industrial symbiosis network equilibrium model by using nonlinear complementarity theory. The industrial symbiosis network consists of industrial producers, industrial consumers, industrial decomposers and demand markets, which imitates natural ecosystem by means of exchanging by-products and recycling useful materials exacted from wastes. The industrial producers and industrial consumers are assumed to be concerned with maximization of economic profits as well as minimization...
The Operational Flight and Multi-Crew Scheduling Problem
The Optimal Control in Batch Arrival Queue With Server Vacations, Startup and Breakdowns
The periodic Vehicle routing problem: classification and heuristic
Periodic Vehicle Routing Problem: classification and heuristic for tactical planning. The Periodic Vehicle Routing Problem (PVRP) consists in assigning customer visits to vehicle routes in some periods of a time horizon so as to satisfy some service level requirements that can take the form of frequency of visit, constraint on time lag between visits, or pre-defined visit patterns. We present different variants of this problem and propose a classification. Then, we consider a model for tactical...
The PH/M/c queue with varying environment
The predictive distribution in decision theory: A case study.
The Procedure to Determine Microstate Probabilities in a Trunk Group Serving Overflow Traffic