Quite often transportation companies face two types of jobs, ones which they can plan themselves and ones which have to be done on call. In this paper we study the scheduling of these jobs, while we assume that job durations are known beforehand as well as windows in which the jobs need to be...

We model a boundedly rational agent who suffers from limited attention. The agent considers each feasible alternative with a given (unobservable) probability, the attention parameter, and then chooses the alternative that maximises a preference relation within the set of considered alternatives....

This paper deals with the search of optimal paths in a multi-stage stochastic decision network as a first application of the deterministic approximation approach proposed by Tadei et al. [48]. In the network, the involved utilities are stage-dependent and contain random oscillations with an...

We consider dynamic assortment optimization with incomplete information under the uncapacitated multinomial logit choice model. We propose an anytime stochastic approximation policy and prove that the regret - the cumulative expected revenue loss caused by offering suboptimal assortments - after...