Tzur Michal

Michal Tzur

Information about the author Michal Tzur will soon be added to the site.
Found 19 papers in total
Lot sizing with learning and forgetting in setups: Analytical results and insights
Lot sizing with learning and forgetting in setups: Analytical results and insights
2016
This article considers the dynamic lot sizing problem when there is learning and...
The single and multi-item transshipment problem with fixed transshipment costs
The single and multi-item transshipment problem with fixed transshipment costs
2014
This article deals with supply chain systems in which lateral transshipments are...
An Efficient and Robust Design for Transshipment Networks
An Efficient and Robust Design for Transshipment Networks
2011
Transshipment, the sharing of inventory among parties at the same echelon level of a...
A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
2011
We introduce a new assignment and scheduling problem in a distribution system, which...
The transshipment fund mechanism: Coordinating the decentralized multilocation transshipment problem
The transshipment fund mechanism: Coordinating the decentralized multilocation transshipment problem
2010
The multilocation replenishment and transshipment problem is concerned with several...
Progressive interval heuristics for multi-item capacitated lot-sizing problems
Progressive interval heuristics for multi-item capacitated lot-sizing problems
2007
We consider a family of N items that are produced in, or obtained from, the same...
Flexibility and complexity in periodic distribution problems
Flexibility and complexity in periodic distribution problems
2007
In this paper, we explore trade-offs between operational flexibility and operational...
Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
2006
We consider a two-stage supply chain, in which multi-items are shipped from a...
Shipping multiple items by capacitated vehicles: An optimal dynamic programming approach
Shipping multiple items by capacitated vehicles: An optimal dynamic programming approach
2005
We consider a system in which multiple items are transferred from a warehouse or a...
Transshipments: An emerging inventory recourse to achieve supply chain leagility
Transshipments: An emerging inventory recourse to achieve supply chain leagility
2002
Supply chain designs are constrained by the cost-service trade-off. Cost minimization...
The dynamic transshipment problem
The dynamic transshipment problem
2001
We investigate the strategy of transshipments in a dynamic deterministic demand...
Storage management of items in two levels of availability
Storage management of items in two levels of availability
2000
This paper is concerned with the problem of storage management of non-consumable items...
Time-partitioning heuristics: Application to one warehouse, multiitem, Multiretailer lot-sizing problems
Time-partitioning heuristics: Application to one warehouse, multiitem, Multiretailer lot-sizing problems
1999
We describe effective time partitioning heuristics for dynamic lot-sizing problems in...
Learning in setups: Analysis, minimal forecast horizons, and algorithms
Learning in setups: Analysis, minimal forecast horizons, and algorithms
1996
We analyze the dynamic lot-sizing model in which the cost of a setup depends on the...
The Joint Replenishment Problem with the time-varying costs and demands: Efficient, asymptotic and &epsià-optimal solutions
The Joint Replenishment Problem with the time-varying costs and demands: Efficient, asymptotic and &epsià-optimal solutions
1994
The authors address the Joint Problem where, in the presence of joint setup costs,...
Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future
Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future
1996
Many sequential planning problems can be represented as a shortest path problem in an...
Fast solution and detection of minimal forecast horizons in dynamic programs with a single indicator of the future: Applications to dynamic lot-sizing models
Fast solution and detection of minimal forecast horizons in dynamic programs with a single indicator of the future: Applications to dynamic lot-sizing models
1995
In most dynamic planning problems, one observes that an optimal decision at any given...
Minimal forecast horizons and a new planning procedure for the general dynamic lot sizing model: Nervousness revisited
Minimal forecast horizons and a new planning procedure for the general dynamic lot sizing model: Nervousness revisited
1994
The authors show for the general dynamic lot sizing model how minimal forecast...
The dynamic lot-sizing model with backlogging: A simple O(nlogn) algorithm and minimal forecast horizon procedure
The dynamic lot-sizing model with backlogging: A simple O(nlogn) algorithm and minimal forecast horizon procedure
1993
The authors develop a simple O( n log n) solution method for the standard lot-sizing...
Papers per page: