J
Jeffrey W. Herrmann
Researcher at University of Maryland, College Park
Publications - 176
Citations - 3298
Jeffrey W. Herrmann is an academic researcher from University of Maryland, College Park. The author has contributed to research in topics: New product development & Scheduling (production processes). The author has an hindex of 25, co-authored 165 publications receiving 3056 citations. Previous affiliations of Jeffrey W. Herrmann include University of Maryland, Baltimore & University of Florida.
Papers
More filters
Journal ArticleDOI
Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods
TL;DR: A framework for understanding rescheduling strategies, policies, and methods based on a wide variety of experimental and practical approaches that have been described in the rescheduled literature is described.
A Survey of Queuing Theory Applications in Healthcare
TL;DR: A range of queuing theory results in the following areas are summarized: waiting time and utilization analysis, system design, and appointment systems, for systems at different scales, including individual departments, healthcare facilities, and regional healthcare systems.
Proceedings ArticleDOI
A genetic algorithm for minimax optimization problems
TL;DR: Experimental results show that the two-space genetic algorithm can find robust solutions for minimax optimization problems, and this paper uses the algorithm to solve a parallel machine scheduling problem with uncertain processing times.
Book
Handbook of production scheduling
TL;DR: A history of production scheduling can be found in this article, where the human factor in planning and scheduling is discussed and a review of long and short-term production scheduling at Lkab's Kiruna Mine is presented.
Journal ArticleDOI
On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
TL;DR: It is shown that for a given schedule of tardy jobs, the problem of scheduling the batch deliveries is equivalent to the dynamic lot sizing problem and some special cases that are solvable in polynomial time are discussed.