Wouter Vink

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We study appointment scheduling problems in continuous time. A finite number of clients are scheduled such that a function of the waiting time of clients, the idle time of the server, and the lateness of the schedule is minimized. The optimal schedule is notoriously hard to derive within reasonable computation times. Therefore, we develop the lag order(More)
  • 1