N
Nicholas G. Hall
Researcher at Max M. Fisher College of Business
Publications - 104
Citations - 5730
Nicholas G. Hall is an academic researcher from Max M. Fisher College of Business. The author has contributed to research in topics: Scheduling (computing) & Dynamic priority scheduling. The author has an hindex of 36, co-authored 98 publications receiving 5385 citations. Previous affiliations of Nicholas G. Hall include Ohio State University & University of Pennsylvania.
Papers
More filters
Journal ArticleDOI
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
TL;DR: Several well-documented applications of no-wait and blocking scheduling models are described and some ways in which the increasing use of modern manufacturing methods gives rise to other applications are illustrated.
Journal ArticleDOI
Supply chain scheduling: Batching and delivery
Nicholas G. Hall,Chris N. Potts +1 more
TL;DR: It is demonstrated that cooperation between a supplier and a manufacturer may reduce the total system cost by at least 20%, or 25%, or by up to 100%, depending upon the scheduling objective, which has practical implications for improving the efficiency of supply chains.
Journal ArticleDOI
Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
Nicholas G. Hall,Marc E. Posner +1 more
TL;DR: It is proved that the recognition version of this problem is NP-complete in the ordinary sense, and a computationally efficient dynamic programming algorithm is presented that is polynomially solvable.
Journal ArticleDOI
Zest and work
TL;DR: For example, this paper found that zest predicted the stance that work was a calling, as well as work satisfaction and general life satisfaction, and the attitude that work is a calling.
Journal ArticleDOI
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date
TL;DR: In this article, the authors consider the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late.