tailieunhanh - Optimal appointment scheduling with a stochastic server: Simulation based K-steps look-ahead selection method
This paper studies the problem of scheduling a finite set of customers with stochastic service times for a single-server system. The objective is to minimize the waiting time of customers, the idle time of the server, and the lateness of the schedule. Because of the NP-hardness of the problem, the optimal schedule is notoriously hard to derive with reasonable computation times. | Optimal appointment scheduling with a stochastic server Simulation based K-steps look-ahead selection method
đang nạp các trang xem trước