3 problems

Consider the stochastic appointment scheduling problem with a finite set of jobs, each having a service-time distribution, and the $l_1$-type objective of minimizing expected idle…

Consider a finite set of jobs with independent exponentially distributed service times to be scheduled on a single machine. For two jobs, the least variance first (LVF) policy is o…

Consider a finite set of jobs with random service times to be scheduled on a single machine. An index-based sequencing policy assigns each job an index and schedules the jobs in in…