Thesis (M.S.)--Ohio University, August, 1991. / Title from PDF t.p.

Thesis (doctoral)--Universität, Darmstadt. / Title from e-book title screen (viewed Oct. 16, 2007). Description based on print version record. Includes bibliographical references ([203]-216).

Thesis (Ph. D.)--University of Washington, 1998. / Vita. Includes bibliographical references (leaves [103]-107).

Thesis (Ph. D.)--Lehigh University, 1999. / Includes vita. Includes bibliographical references (leaves 140-150).

Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references. Available also from UMI Company.

Thesis (Ph.D.) -- McMaster University, 1999. / Includes bibliographical references (leaves 92-95). Also available via World Wide Web.

No description available.

Thesis (Ph. D.)--University of Hong Kong, 1999. / Includes bibliographical references.

This dissertation addresses the problem of scheduling a set of jobs under two different measures of performance: total tardiness and weighted number of tardy jobs. A new solution approach is presented for the single-machine tardiness problem. This views the problem as one of determining an optimal partition of the job set into early and tardy subsets. The scheme is validated by the development of necessary conditions for optimality. It is shown that if an optimal partition of the jobs into early and tardy subsets is given, the conditions are not only necessary but also sufficient. These results are used to derive a polynomial algorithm to generate a sequence that satisfies these conditions for any arbitrary partition. The implications of these results with respect to solving the tardiness problem, as well as some other related problems, are examined. Particular emphasis is placed on the impact of the partition approach as a device to enhance the performance of existing branch-and-bound procedures. The use of this approach to generate valid inequalities is also discussed. The problem of scheduling a single machine to minimize the weighted number of tardy jobs is examined in detail. A new branch-and-bound procedure is presented as well as the first extensive computational study of the problem. The proposed algorithm relies on lower bounds obtained by means of two relaxations of the problem for which efficient solution procedures exist. The merits of both bounding schemes are extensively tested. The computational results indicate that exact solutions for large problems can be obtained in just a few seconds of computer time. The efficacy of the approach as a heuristic method is also verified. Further, the computational experience provides insight into how various problem parameters affect the solution difficulty of particular problem instances. The multiple-processor version of the weighted number of tardy jobs model is also considered. The basic algorithmic framework for the single-machine problem is extended to obtain optimal preemptive schedules for parallel machines, which may be identical, uniform, or unrelated.

No description available.