We present a greedy heuristic for the n job/1 machine scheduling problem with precedence constraints. This method is useful whenever the manager's optimization criteria is the sum of weighted or unweighted completion times, the sum of weighted or unweighted flow times, (with or without release...

We study the optimal control of a queueing system with Poisson input and a server capable of serving an infinite number of customers per batch. It is known that the optimal type of control policy is a control limit policy: service should begin if and only if the number of waiting customers is at...

We examine the method used for seeding teams in professional sports leagues after the regular season has ended. In particular, we are interested in which teams are in the playoffs and which of these playoff teams get the home field advantage and/or a first round bye. We show that the regular...