Ton G. de Kok
Orcid: 0000-0001-8622-8599
According to our database1,
Ton G. de Kok
authored at least 51 papers
between 1985 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2022
Eur. J. Oper. Res., 2022
2021
Eur. J. Oper. Res., 2021
2020
OR Spectr., 2020
OR Spectr., 2020
2019
IISE Trans., 2019
Eur. J. Oper. Res., 2019
Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan.
Eur. J. Oper. Res., 2019
Evaluating Mixed Integer Programming Models for Solving Stochastic Inventory Problems.
Proceedings of the 2019 Winter Simulation Conference, 2019
2018
Modelling short-term manufacturing flexibility by human intervention and its impact on performance.
Int. J. Prod. Res., 2018
Found. Trends Technol. Inf. Oper. Manag., 2018
Integer programming models for mid-term production planning for high-tech low-volume supply chains.
Eur. J. Oper. Res., 2018
Eur. J. Oper. Res., 2018
Optimal and heuristic policies for assemble-to-order systems with different review periods.
Eur. J. Oper. Res., 2018
2017
2016
Manuf. Serv. Oper. Manag., 2016
Exact Analysis of Divergent Inventory Systems with Time-Based Shipment Consolidation and Compound Poisson Demand.
Oper. Res., 2016
2015
Proceedings of the 2015 Winter Simulation Conference, 2015
2014
OR Spectr., 2014
Interfaces, 2014
Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach.
Eur. J. Oper. Res., 2014
2013
Transp. Sci., 2013
Vehicle routing problem with stochastic travel times including soft time windows and service costs.
Comput. Oper. Res., 2013
Dynamic shortest path problems: Hybrid routing policies considering network disruptions.
Comput. Oper. Res., 2013
Newsvendor characterizations for one-warehouse multi-retailer inventory systems with discrete demand under the balance assumption.
Central Eur. J. Oper. Res., 2013
2012
Determining the reorder point and order-up-to level to satisfy two constraints in a periodic review system under negative binomial demand.
J. Oper. Res. Soc., 2012
2008
Newsvendor equations for optimal reorder levels of serial inventory systems with fixed batch sizes.
Oper. Res. Lett., 2008
2005
Interfaces, 2005
Linear programming models with planned lead times for supply chain operations planning.
Eur. J. Oper. Res., 2005
2004
OR Spectr., 2004
Ann. Oper. Res., 2004
2003
Proceedings of the Supply Chain Management: Design, Coordination and Operation, 2003
Proceedings of the Supply Chain Management: Design, Coordination and Operation, 2003
2001
J. Oper. Res. Soc., 2001
Eur. J. Oper. Res., 2001
2000
1999
The impact of data collection on fill rate performance in the (R, s, Q) inventory model.
J. Oper. Res. Soc., 1999
The simultaneous determination of the assignment ofitems to resources, the cycle times, and the reorderintervals in repetitive PCB assembly.
Ann. Oper. Res., 1999
1998
Eur. J. Oper. Res., 1998
1997
Eur. J. Oper. Res., 1997
1992
Customer waiting times in an (<i>R, S</i>) inventory system with compound Poisson demand.
ZOR Methods Model. Oper. Res., 1992
1985
A Two-Moment Approximation for a Buffer Design Problem Requiring a Small Rejection Probability.
Perform. Evaluation, 1985