IDEAS home Printed from https://ideas.repec.org/e/pvr16.html
   My authors  Follow this author

Tjark Vredeveld

Personal Details

First Name:Tjark
Middle Name:
Last Name:Vredeveld
Suffix:
RePEc Short-ID:pvr16
[This author has chosen not to make the email address public]

Affiliation

(in no particular order)

School of Business and Economics
Maastricht University

Maastricht, Netherlands
http://www.maastrichtuniversity.nl/sbe
RePEc:edi:femaanl (more details at EDIRC)

Graduate School of Business and Economics (GSBE)
School of Business and Economics
Maastricht University

Maastricht, Netherlands
http://www.maastrichtuniversity.nl/SBE
RePEc:edi:meteonl (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Grigoriev, A. & Hiller, B. & Marban, S. & Vredeveld, T. & van der Zwaan, G.R.J., 2010. "Dynamic pricing problems with elastic demand," Research Memorandum 053, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  2. Marban, S. & Rutten, C. & Vredeveld, T., 2010. "Tight performance in Bayesian scheduling," Research Memorandum 052, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  3. Hiller, B. & Vredeveld, T., 2009. "Probabilistic alternatives for competitive analysis," Research Memorandum 053, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  4. Recalde, D. & Rutten, C. & Schuurman, P. & Vredeveld, T., 2009. "Local search performance guarantees for restricted related parallel machine scheduling," Research Memorandum 061, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  5. Hiller, B. & Vredeveld, T., 2009. "Simple optimality proofs for Least Recently Used in the presence of locality of reference," Research Memorandum 055, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  6. Megow, N. & Vredeveld, T., 2009. "Approximating preemptive stochastic scheduling," Research Memorandum 054, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  7. Hiller, B. & Vredeveld, T., 2008. "Probabilistic analysis of Online Bin Coloring algorithms via stochastic comparison," Research Memorandum 006, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  8. Grigoriev, A. & van Loon, J. & Sviridenko, M. & Uetz, M.J. & Vredeveld, T., 2008. "Optimal bundle pricing with monotonicity constraint," Research Memorandum 015, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  9. Brueggemann, T. & Hurink, J.L. & Vredeveld, T. & Woeginger, G.J., 2006. "Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines," Research Memorandum 052, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  10. Megow, N. & Vredeveld, T., 2006. "Approximation results for preemptive stochastic online scheduling," Research Memorandum 053, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  11. van Loon, J. & Grigoriev, A. & Uetz, M.J. & Vredeveld, T., 2006. "Optimal bundle pricing for homogeneous items," Research Memorandum 050, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  12. Rohde, K.I.M., 2005. "A reason for sophisticated investors not to seize arbitrage opportunities in markets without frictions," Research Memorandum 054, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  13. Schuurman, P. & Vredeveld, T., 2005. "Performance guarantees of local search for multiprocessor scheduling," Research Memorandum 055, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  14. de Bruin, A. & Kindervater, G.A.P. & Vredeveld, T. & Wagelmans, A.P.M., 1999. "Finding a Feasible Solution for a Simple LP Problem using Agents," Econometric Institute Research Papers EI 9921/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

Articles

  1. Sven Krumke & Sleman Saliba & Tjark Vredeveld & Stephan Westphal, 2008. "Approximation algorithms for a vehicle routing problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 333-359, October.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Grigoriev, A. & Hiller, B. & Marban, S. & Vredeveld, T. & van der Zwaan, G.R.J., 2010. "Dynamic pricing problems with elastic demand," Research Memorandum 053, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    Cited by:

    1. Rana, Rupal & Oliveira, Fernando S., 2014. "Real-time dynamic pricing in a non-stationary environment using model-free reinforcement learning," Omega, Elsevier, vol. 47(C), pages 116-126.
    2. Viktoryia Buhayenko & Sin C. Ho & Anders Thorstenson, 2018. "A variable neighborhood search heuristic for supply chain coordination using dynamic price discounts," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(4), pages 363-385, December.

  2. Hiller, B. & Vredeveld, T., 2009. "Probabilistic alternatives for competitive analysis," Research Memorandum 053, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    Cited by:

    1. Bakker, Hannah & Dunke, Fabian & Nickel, Stefan, 2020. "A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice," Omega, Elsevier, vol. 96(C).

  3. Recalde, D. & Rutten, C. & Schuurman, P. & Vredeveld, T., 2009. "Local search performance guarantees for restricted related parallel machine scheduling," Research Memorandum 061, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    Cited by:

    1. Leung, Joseph Y.-T. & Li, Chung-Lun, 2016. "Scheduling with processing set restrictions: A literature update," International Journal of Production Economics, Elsevier, vol. 175(C), pages 1-11.
    2. Tobias Brueggemann & Johann L. Hurink & Tjark Vredeveld & Gerhard J. Woeginger, 2011. "Exponential size neighborhoods for makespan minimization scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 795-803, December.

  4. Megow, N. & Vredeveld, T., 2009. "Approximating preemptive stochastic scheduling," Research Memorandum 054, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    Cited by:

    1. Varun Gupta & Benjamin Moseley & Marc Uetz & Qiaomin Xie, 2020. "Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 497-516, May.

  5. Grigoriev, A. & van Loon, J. & Sviridenko, M. & Uetz, M.J. & Vredeveld, T., 2008. "Optimal bundle pricing with monotonicity constraint," Research Memorandum 015, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    Cited by:

    1. Grigoriev, A. & Hiller, B. & Marban, S. & Vredeveld, T. & van der Zwaan, G.R.J., 2010. "Dynamic pricing problems with elastic demand," Research Memorandum 053, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    2. Iftah Gamzu & Danny Segev, 2017. "A Sublogarithmic Approximation for Tollbooth Pricing on Trees," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 377-388, May.

  6. Megow, N. & Vredeveld, T., 2006. "Approximation results for preemptive stochastic online scheduling," Research Memorandum 053, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    Cited by:

    1. Huiqiao Su & Guohua Wan & Shan Wang, 2019. "Online scheduling for outpatient services with heterogeneous patients and physicians," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 123-149, January.
    2. Marban, S. & Rutten, C. & Vredeveld, T., 2010. "Asymptotic optimality of SEPT in Bayesian scheduling," Research Memorandum 050, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    3. Vredeveld, T., 2009. "Stochastic Online Scheduling," Research Memorandum 052, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    4. Marban, S. & Rutten, C. & Vredeveld, T., 2010. "Tight performance in Bayesian scheduling," Research Memorandum 052, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

  7. Rohde, K.I.M., 2005. "A reason for sophisticated investors not to seize arbitrage opportunities in markets without frictions," Research Memorandum 054, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    Cited by:

    1. Cole, Richard & Correa, Jose & Gkatzelis, Vasillis & Mirrokni, Vahab & Olver, Neil, 2015. "Decentralized utilitarian mechanisms for scheduling games," LSE Research Online Documents on Economics 103081, London School of Economics and Political Science, LSE Library.
    2. Yossi Azar & Lisa Fleischer & Kamal Jain & Vahab Mirrokni & Zoya Svitkina, 2015. "Optimal Coordination Mechanisms for Unrelated Machine Scheduling," Operations Research, INFORMS, vol. 63(3), pages 489-500, June.
    3. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    4. Guoqiang Fan & Qingqin Nong, 2018. "A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-15, October.
    5. Brueggemann, T. & Hurink, J.L. & Vredeveld, T. & Woeginger, G.J., 2006. "Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines," Research Memorandum 052, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    6. Heydenreich, B. & Müller, R.J. & Uetz, M.J., 2006. "Games and mechanism design in machine scheduling - an introduction," Research Memorandum 022, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

  8. Schuurman, P. & Vredeveld, T., 2005. "Performance guarantees of local search for multiprocessor scheduling," Research Memorandum 055, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    Cited by:

    1. Cole, Richard & Correa, Jose & Gkatzelis, Vasillis & Mirrokni, Vahab & Olver, Neil, 2015. "Decentralized utilitarian mechanisms for scheduling games," LSE Research Online Documents on Economics 103081, London School of Economics and Political Science, LSE Library.
    2. Yossi Azar & Lisa Fleischer & Kamal Jain & Vahab Mirrokni & Zoya Svitkina, 2015. "Optimal Coordination Mechanisms for Unrelated Machine Scheduling," Operations Research, INFORMS, vol. 63(3), pages 489-500, June.
    3. Q. Q. Nong & G. Q. Fan & Q. Z. Fang, 2017. "A coordination mechanism for a scheduling game with parallel-batching machines," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 567-579, February.
    4. Guoqiang Fan & Qingqin Nong, 2018. "A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-15, October.
    5. Francisco Castillo-Zunino & Pinar Keskinocak, 2021. "Bi-criteria multiple knapsack problem with grouped items," Journal of Heuristics, Springer, vol. 27(5), pages 747-789, October.
    6. Cong Chen & Yinfeng Xu, 0. "Coordination mechanisms for scheduling selfish jobs with favorite machines," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-33.
    7. Cong Chen & Yinfeng Xu, 2020. "Coordination mechanisms for scheduling selfish jobs with favorite machines," Journal of Combinatorial Optimization, Springer, vol. 40(2), pages 333-365, August.

Articles

  1. Sven Krumke & Sleman Saliba & Tjark Vredeveld & Stephan Westphal, 2008. "Approximation algorithms for a vehicle routing problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 333-359, October.

    Cited by:

    1. Peter van Huigenbosch & Joris van de Klundert & Laurens Wormer, 2011. "ANWB Automates and Improves Service Personnel Dispatching," Interfaces, INFORMS, vol. 41(2), pages 123-134, April.
    2. Farshad Majzoubi & Lihui Bai & Sunderesh S. Heragu, 2021. "The EMS vehicle patient transportation problem during a demand surge," Journal of Global Optimization, Springer, vol. 79(4), pages 989-1006, April.
    3. Huigenbosch, P. & van de Klundert, J. & Wormer, L., 2008. "ANWB automates and improves repair men dispatching," Research Memorandum 055, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 6 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-CMP: Computational Economics (2) 2006-01-01 2006-12-16
  2. NEP-MIC: Microeconomics (2) 2006-12-16 2008-07-30
  3. NEP-MKT: Marketing (2) 2006-12-16 2010-12-04
  4. NEP-IND: Industrial Organization (1) 2010-12-04
  5. NEP-ORE: Operations Research (1) 2008-06-21

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Tjark Vredeveld should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.