Journal: Journal of Information & Optimization Sciences

Found 347 papers in total
Optimal inventory replenishment model with time-varying demand, Weibull distribution deterioration and shortages under a shortage followed by inventory policy
2001,
We consider here the inventory replenishment problem over a finite time horizon for a...
An integrated inventory model for supplier and retailer with defective items
2001,
This article develops a model to determine an optimal integrated...
A deteriorating inventory model with a temporary price discount: A present-value approach
2001,
Inventory models considering a temporary price discount have recently become an active...
The traveling salesman problem: New polynomial approximation algorithms and domination analysis
2001,
For the traveling salesman problem (TSP) on n nodes, we show that a tour which is...
Probabilistic analysis of dynamic inventory models with general demand pattern
2001,
This paper discusses a probabilistic inventory model without setup costs and lead...
Goyal's inventory model revisited
2001,
We study the inventory model with deteriorating items and time-varying demand and...
Two-stage production plan of probabilistic market demand with unreliable machines and obtainable working hour capacity
2001,
The Two-Stage Production Plan (PP) Model for reaching the optimal production rate of...
A note on the inventory model of Benkherouf
2001,
We study the inventory model with deteriorating items and decreasing time varying...
A simple verification for the n-th moment of the backlog for the periodic review (s, S) inventory system
2001,
We derive a simple method to prove the n -th moment of the warehouse backlog for the...
The (s, Q) inventory system for fast moving items
2001,
This article explores the ( s, Q ) inventory system for fast moving items. It is...
Investigation of maintenance float problem using genetic algorithms
2001,
Maintenance float problems in a flexible manufacturing system tend to become...
Solving dynamic model of environment pollution and sustainable development by the degenerate simplex method
2001,
The purpose of this paper is to approve how the degenerate simplex method solving the...
On nonsmooth minimax programming problems containing V-ρ-invexity
2000,
We consider a class of nonsmooth minimax programming problems in which functions are...
Single machine scheduling with two job classes: Minimizing maximum lateness
2000,
In this paper a single machine scheduling problem with two job classes is considered....
A heuristic algorithm for the multi-depot periodic vehicle routing problem
2000,
This work addresses the periodic vehicle routing problem of single product supplied by...
Nonsmooth vector-valued invex functions and applications
2000,
Various types of locally Lipschitz vector-valued invex (and generalized invex)...
The optimal level solution method applied to a non linear programming problem with exponential objective function
2000,
A nonlinear programming problem with exponential objective function is solved using...
Subjective games in a non-cooperative game
2000,
There are many examples of non-cooperative games in which a player does not...
Mond–Weir type duality involving (B, η)-invex functions for a minmax programming problem
2000,
Several Mond–Weir type duals are proposed for a certain minmax programming...
Stochastic operation models for open inventory networks
1999,
Open inventory networks have been modelled by dynamic fuzzy criterion models. This...
A note on the distribution free procedure for some inventory models
1999,
We study the paper of Moon and Guillermo on the distribution free procedure for some...
Approximation of optimal order policy for deteriorating items with a linearly increasing demand
1999,
We consider the paper recently published in Optimization by Chung and Ting. They...
On dynamic policies for quality, prices and advertising
1999,
This study presents a novel algorithm to derive the long term policies of quality...
A genetic approach to Kanban assignment problems
1997,
In this paper, an effective genetic Kanban assignment algorithm is developed to...
Papers per page: