Rene Haijema
Rene Haijema
Bestätigte E-Mail-Adresse bei wur.nl
Titel
Zitiert von
Zitiert von
Jahr
Blood platelet production: Optimization by dynamic programming and simulation
R Haijema, J van der Wal, NM van Dijk
Computers & Operations Research 34 (3), 760-779, 2007
2402007
A framework for designing robust food supply chains
JV Vlajic, JGAJ Van der Vorst, R Haijema
International Journal of Production Economics 137 (1), 176-189, 2012
2252012
Modeling a green inventory routing problem for perishable products with horizontal collaboration
M Soysal, JM Bloemhof-Ruwaard, R Haijema, JGAJ van der Vorst
Computers & Operations Research 89, 168-182, 2018
1882018
Modeling an inventory routing problem for perishable products with environmental considerations and demand uncertainty
M Soysal, JM Bloemhof-Ruwaard, R Haijema, JGAJ van der Vorst
International Journal of Production Economics 164, 118-133, 2015
1862015
Blood platelet production: a novel approach for practical optimization
N Van Dijk, R Haijema, J Van Der Wal, CS Sibinga
Transfusion 49 (3), 411-420, 2009
1492009
Blood platelet production with breaks: optimization by SDP and simulation
R Haijema, N van Dijk, J van der Wal, CS Sibinga
International Journal of Production Economics 121 (2), 464-473, 2009
1242009
Logistics network design for perishable products with heterogeneous quality decay
M de Keizer, R Akkerman, M Grunow, JM Bloemhof, R Haijema, ...
European Journal of Operational Research 262 (2), 535-549, 2017
882017
A new class of stock-level dependent ordering policies for perishables with a short maximum shelf life
R Haijema
International Journal of Production Economics 143 (2), 434-439, 2013
742013
Discounting and dynamic shelf life to reduce fresh food waste at retailers
ME Buisman, R Haijema, JM Bloemhof-Ruwaard
International Journal of Production Economics 209, 274-284, 2019
672019
Hybrid optimization and simulation to design a logistics network for distributing perishable products
M De Keizer, R Haijema, JM Bloemhof, JGAJ Van Der Vorst
Computers & Industrial Engineering 88, 26-38, 2015
612015
An MILP approximation for ordering perishable products with non-stationary demand and service level constraints
KGJ Pauls-Worm, EMT Hendrix, R Haijema, JGAJ van der Vorst
International Journal of Production Economics 157, 133-146, 2014
502014
Optimal ordering, issuance and disposal policies for inventory management of perishable products
R Haijema
International Journal of Production Economics 157, 158-169, 2014
502014
Order quantities for perishable inventory control with non-stationary demand and a fill rate constraint
KGJ Pauls-Worm, EMT Hendrix, AG Alcoba, R Haijema
International Journal of Production Economics 181, 238-246, 2016
482016
A systematic approach to preventing chilled-food waste at the retail outlet
SO Tromp, R Haijema, H Rijgersberg, JGAJ van der Vorst
International Journal of Production Economics 182, 508-518, 2016
422016
Using vulnerability performance indicators to attain food supply chain robustness
JV Vlajic, SWM van Lokven, R Haijema, JGAJ van Der Vorst
Production Planning & Control 24 (8-9), 785-799, 2013
422013
An MDP decomposition approach for traffic control at isolated signalized intersections
R Haijema, J van der Wal
Probability in the Engineering and Informational Sciences 22 (4), 587-602, 2008
422008
Stock-level dependent ordering of perishables: A comparison of hybrid base-stock and constant order policies
R Haijema, S Minner
International Journal of Production Economics 181, 215-225, 2016
392016
Improved ordering of perishables: The value of stock-age information
R Haijema, S Minner
International Journal of Production Economics 209, 316-324, 2019
292019
Train shunting: A practical heuristic inspired by dynamic programming
R Haijema, C Duin, NM Van Dijk
Planning in intelligent systems: aspects, motivations, and methods, 437-475, 2006
272006
Blood platelet production: A multi-type perishable inventory problem
R Haijema, J van der Wal, NM van Dijk
Operations Research Proceedings 2004, 84-92, 2005
272005
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20