Individuals behave with choice probabilities defined by a multinomial logit (MNL) probability distribution over a finite number of alternatives which includes utilities as parameters. The salient feature of the model is that probabilities depend on the choice-set, or domain. Expanding the...

We study an online-list scheduling problem on a set of m multipurpose machines for which the objective is to minimize the makespan. It is assumed that there are two different job types, and each job type can be processed on a unique subset of machines. We provide an online algorithm with a...