Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Moshe Dror
Information about the author Moshe Dror will soon be added to the site.
Found
34 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Split delivery routing
1990
This article examines a relaxed version of the generic vehicle routing problem. In...
Biform game: Reflection as a stochastic programming problem
2013
In this paper we examine the biform games modeling framework. More specifically, we...
Newsvendor games: convex optimization of centralized inventory operations
2012
A finite set of outlets with randomly fluctuating demands bands together to reduce...
The cost allocation issue in joint replenishment
2012
Joint replenishment for several products to achieve a lower inventory logistics cost...
Managing decentralized inventory and transshipment
2011
Any decentralized retail or wholesale system of competing entities requires a benefit...
The monotonicity of the threshold detection probability in a stochastic accumulation process
1990
In this paper we prove for a number of distributions that the probability for the...
Efficient scheduling of periodic information monitoring requests
2006
In many mission-critical applications such as police and homeland security-related...
A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
2007
Neighbourhood search algorithms are often the most effective known approaches for...
Shipment consolidation: Who pays for it and how much?
2007
This paper examines the subject of cost allocation in a multiple product inventory...
Improved bounds for vehicle routing solutions
2006
We present lower bounds for the vehicle routing problem with and without split...
Randomized distributed access to mutually exclusive resources
2005
Many systems consist of a set of agents which must acquire exclusive access to...
Delivery cost approximations for inventory routing problems in a rolling horizon framework
2002
The inventory routing problem considered in this paper is concerned with the repeated...
Delivery cost approximations for inventory routing problems in a rolling horizon framework
2002
The inventory routing problem considered in this paper is concerned with the repeated...
A note on an open-end bin packing problem
2001
We consider a variant of the classical one-dimensional bin packing problem, which we...
Resource constrained chain scheduling of unit execution time jobs on two machines
1998
A well-known technique for solving scheduling problems with two identical parallel...
‘Strong’–‘weak’ chain constrained scheduling
1997
In this paper we introduce a distinction between the weak and strong modes of...
Large-scale, high-priced applications: An introduction
1997
The editor of this issue of EJOR explains the origin and motivation for the collection...
A project scheduling methodology derived as an analogue of digital circuit technology
1998
The purpose of this paper is to propose a new approach for modeling project activities...
Bifurcation and adaptation in evolutionary interactive multiobjective linear programming
1996
This paper shows how a formal modeling framework, Evolutionary Systems Design, for...
Interactive graphical computer application for large-scale cattle feed distribution management
1997
In this paper we describe the development of a visual computer-based interactive...
Cash flow optimization in delivery scheduling
1996
The paper examines the inventory routing problem from the perspective of the present...
Split-delivery routeing heuristics in livestock feed distribution
1997
This paper describes a feed distribution problem encountered on a cattle ranch in...
A Generalized Traveling Salesman Problem approach to the directed Clustered Rural Postman Problem
1997
In this paper, we examine the directed Clustered Rural Postman Problem (CRPP). The...
Cost allocation in continuous-review inventory models
1996
A centralized inventory system serves a number of stores with common ownership, and...
1
2
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers