-
作者：Jacobson, SH; Yücesan, E
作者单位：University of Illinois System; University of Illinois Urbana-Champaign; INSEAD Business School
摘要：This paper uses computational complexity theory to assess the difficulty of various discrete event simulation problems. More specifically, accessibility of states, ordering of events, noninterchangeability of model implementations, and execution stalling for discrete event simulations are formally stated as search problems and proven to be NP-hard. The consequences of these results cover a wide range of modeling and analysis problems in simulation. For example, problems associated with certain...
-
作者：Brimberg, J; Hurley, WJ; Johnson, RE
作者单位：University of Prince Edward Island; Royal Military College - Canada
摘要：We formulate and solve a location problem that determines where to position punt returners to maximize the number of punts caught. The problem is unusual within the location literature because it includes the dimension of time as well as Euclidean distance. The parameters of the model are estimated from actual punt return data. Our major finding is that the standard horizontal configuration of two punt returners results in only a small increase in the percentage of punts fielded over the case ...
-
作者：Bartholdi, JJ; Bunimovich, LA; Eisenstein, DD
作者单位：University System of Georgia; Georgia Institute of Technology; University of Chicago
摘要：We describe all possible asymptotic behavior of bucket brigade production lines with two or three workers, each characterized by a constant work velocity. The results suggest wariness in interpreting simulation results. They also suggest a strategy for partitioning a workforce into effective teams to staff the lines.
