The relation of time indexed formulations of nonpreemptive single machine schedulingproblems to the node packing problem is formally established and then used toprovide simple and intuitive alternate proofs of validity and maximality for previouslyknown results on the facial structure of the...

Most research on single machine scheduling has assumed the linearity of job holding costs, which is arguably not appropriate in some applications. This motivates our study of a model for scheduling $n$ classes of stochastic jobs on a single machine, with the objective of minimizing the total...

Crew and vehicle scheduling are fundamental issues in public transit management. Informally, they can be described as the problem of determining the optimal duties for a set of crews (e.g., bus drivers) or vehicles (e.g., buses) so as to cover a given set of timetabled trips, satisfying a number...