Thesis (Ph. D.)--University of Wisconsin-Madison, 1984. / Cover title. "This research was facilitated by funding from both the National Institute of Mental Health and the Department of Labor"--Leaf 2. Typescript (photocopy). Includes bibliographical references (leaves 191-196).

Thesis (M.A.)--Indiana University, 2008. / Title from screen (viewed on July 7, 2008). Department of Philanthropic Studies, Indiana University-Purdue University Indianapolis (IUPUI). Advisor(s): Dwight F. Burlingame, Leslie Lenkowsky, Martha I. Pallante. Includes vitae. Includes bibliographical references (leaves 66-69).

Thesis (doctoral)--Uppsala University, 1989. / Abstract and summary in English. Includes bibliographical references (p. 223-242).

Thesis (doctoral)--Uppsala University, 1989. / Abstract and summary in English. Includes bibliographical references (p. 223-242).

Thesis PlanB (M.S.)--University of Wisconsin--Stout, 2006. / Includes bibliographical references.

Indiana University-Purdue University Indianapolis (IUPUI) / Youngstown, Ohio was devastated by the closing of three major steel mills in three years: In all, more than 15,000 steelworkers and another 35,000 in related industries lost jobs in this period. The purpose of this thesis is to study the response of the local nonprofit sector to the closing of the Campbell Works, a mill located just outside the city of Youngstown that employed approximately 4,100. The activities of traditional nonprofit organizations are briefly reviewed; however, much of this study focuses on the story of the Ecumenical Coalition of the Mahoning Valley, a diverse group of religious leaders whose mission evolved into a campaign to garner the resources necessary to purchase the Campbell Works and reopen it as an employee-owned company. Additional analysis is made of Pittsburgh, Pennsylvania and Weirton, West Virginia; two nearby steel centers that faced similar economic downturns in the 1980s and used the lessons learned from the Ecumenical Coalition. The final chapter of this thesis examines the work of two researchers, Vaughn Grisham, Jr. and Richard Cuoto, and their work studying Tupelo, Mississippi and Appalachia, respectively. In these works, we see cities and regions laid bare by stark economic conditions and the collective action taken by a wide variety of constituencies to not only survive but to thrive.

No description available.

Thesis (Ph. D.)--University of Michigan, 1983. / A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Urban, Technological and Environmental Planning : Urban and Regional Planning) in the University of Michigan, 1983. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (p. 205-209).

Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 1996. / Includes bibliographical references (p. 363-393).

We consider the problem of scheduling a given set of tasks on multiple pro- cessors with predefined periods of unavailability, with the aim of minimizing the maximum completion time. Since this problem is strongly NP-hard, polynomial ap- proximation algorithms are being studied for its solution. Among these, the best known are LPT (largest processing time first) and Multifit with their variants. We give a Multifit-based algorithm, FFDL Multifit, which has an optimal worst- case performance in the class of polynomial algorithms for same-speed processors with at most two downtimes on each machine, and for uniform processors with at most one downtime on each machine, assuming that P 6= NP. Our algorithm finishes within 3/2 the maximum between the end of the last downtime and the end of the optimal schedule. This bound is asymptotically tight in the class of polynomial algorithms assuming that P 6= NP. For same-speed processors with at most k downtimes on each machine our algorithm finishes within ( 3 2 + 1 2k ) the end of the last downtime or the end of the optimal schedule. For problems where the optimal schedule ends after the last downtime, and when the downtimes represent fixed jobs, the maximum completion time of FFDL Multifit is within 3 2 or ( 3 2+ 1 2k ) of the optimal maximum completion time. We also give an LPT-based algorithm, LPTX, which matches the performance of FFDL Multifit for same-speed processors with at most one downtime on each machine, and is thus optimal in the class of polynomial algorithms for this case. LPTX differs from LPT in that it uses a specific order of processors to assign tasks if two processors become available at the same time. For a similar problem, when there is at most one downtime on each machine and no more than half of the machines are shut down at the same time, we show that a bound of 2 obtained in a previous work for LPT is asymptotically tight in the class of polynomial algorithms assuming that P 6= NP.