A simple forward algorithm to solve general dynamic lot sizing models with n periods in 0 (n log n) or 0 (n) time A Federgruen, M Tzur Management Science 37 (8), 909-925, 1991 | 547 | 1991 |
Static Repositioning in Bike-Sharing System: Models and Solution Approaches T Raviv, M Tzur, I Forma EURO Journal on Transportation and Logistics 2, 187-229, 2013 | 452 | 2013 |
Design of flexible assembly line to minimize equipment cost J Bukchin, M Tzur Iie transactions 32 (7), 585-598, 2000 | 262 | 2000 |
The period vehicle routing problem and its extensions PM Francis, KR Smilowitz, M Tzur The vehicle routing problem: latest advances and new challenges, 73-102, 2008 | 244 | 2008 |
The multilocation transshipment problem YT Herer, M Tzur, E Yücesan IIE transactions 38 (3), 185-200, 2006 | 226 | 2006 |
The period vehicle routing problem with service choice P Francis, K Smilowitz, M Tzur Transportation science 40 (4), 439-454, 2006 | 200 | 2006 |
A 3-step math heuristic for the static repositioning problem in bike-sharing systems IA Forma, T Raviv, M Tzur Transportation research part B: methodological 71, 230-247, 2015 | 176 | 2015 |
Transshipments: An emerging inventory recourse to achieve supply chain leagility YT Herer, M Tzur, E Yücesan International Journal of production economics 80 (3), 201-212, 2002 | 153 | 2002 |
Progressive interval heuristics for multi-item capacitated lot-sizing problems A Federgruen, J Meissner, M Tzur Operations Research 55 (3), 490-502, 2007 | 132 | 2007 |
Parking reservation policies in one-way vehicle sharing systems M Kaspi, T Raviv, M Tzur Transportation Research Part B: Methodological 62, 35-50, 2014 | 110 | 2014 |
The dynamic transshipment problem YT Herer, M Tzur Naval Research Logistics (NRL) 48 (5), 386-408, 2001 | 109 | 2001 |
Minimal forecast horizons and a new planning procedure for the general dynamic lot sizing model: Nervousness revisited A Federgruen, M Tzur Operations Research 42 (3), 456-468, 1994 | 78 | 1994 |
Shipping multiple items by capacitated vehicles: An optimal dynamic programming approach S Anily, M Tzur Transportation Science 39 (2), 233-248, 2005 | 76 | 2005 |
The joint replenishment problem with time-varying costs and demands: Efficient, asymptotic and å-optimal solutions A Federgruen, M Tzur Operations Research 42 (6), 1067-1086, 1994 | 74 | 1994 |
Time‐partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot‐sizing problems A Federgruen, M Tzur Naval Research Logistics (NRL) 46 (5), 463-486, 1999 | 72 | 1999 |
Lot splitting to minimize average flow-time in a two-machine flow-shop J Bukchin, M Tzur, M Jaffe IIE transactions 34 (11), 953-970, 2002 | 69 | 2002 |
The dynamic lot‐sizing model with backlogging: A simple o(n log n) algorithm and minimal forecast horizon procedure A Federgruen, M Tzur Naval Research Logistics (NRL) 40 (4), 459-478, 1993 | 68 | 1993 |
Flexibility and complexity in periodic distribution problems P Francis, K Smilowitz, M Tzur Naval Research Logistics (NRL) 54 (2), 136-150, 2007 | 59 | 2007 |
Allocation of bandwidth and storage B Chen, R Hassin, M Tzur Iie Transactions 34 (5), 501-507, 2002 | 59 | 2002 |
Regulating vehicle sharing systems through parking reservation policies: Analysis and performance bounds M Kaspi, T Raviv, M Tzur, H Galili European Journal of Operational Research 251 (3), 969-987, 2016 | 56 | 2016 |