Thom J. Hodgson

Learn More
We address questions raised by Lobo et al. in 2012 regarding the NP-hard problem of finding an optimal allocation of workers to machine groups in a job shop so as to minimize L max , the maximum job lateness. Lobo et al. formulated a lower bound on L max given a worker allocation, and an algorithm to find an allocation yielding the smallest such lower(More)
Keywords: Job shop scheduling Dual resource constrained systems Maximum lateness Worker allocation a b s t r a c t A common industrial operation is a dual resource constrained job shop where: (a) the objective is to minimize L max , the maximum job lateness; (b) machines are organized into groups; and (c) each worker is assigned to a specific machine group.(More)
Are current expenditures on dying patients disproportionate, unreasonable, or unjust? Although a review of empirical data reveals that care for the terminally ill is very costly, it is not appropriate to conclude that such expenditures represent a morally troubling misallocation of societal resources. Moreover, though efforts to reduce the costs of caring(More)
The Virtual Factory is a job shop scheduling tool that was developed at NC State. It has been found to provide nearoptimal solutions to industrial-sized problems in seconds. Recently, the Virtual Factory was expanded to include interfactory transportation operations which enabled the detailed scheduling of entire multi-factory manufacturing supply chains.(More)
This paper addresses a static, n-job, single-machine scheduling problem with sequence dependent family setups. The setup matrix follows a special structure where a constant setup is required only if a job from a smaller indexed family is an immediate successor of one from a larger indexed family. The objective is to minimize the maximum lateness (L max). A(More)