Gail W. DePuy

Affiliations: 
University of Louisville, Louisville, KY, United States 
Area:
Industrial Engineering
Google:
"Gail DePuy"
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Moghaddam KS, DePuy GW. (2011) Farm management optimization using chance constrained programming method Computers and Electronics in Agriculture. 77: 229-237
Hepdogan S, Moraga RJ, DePuy GW, et al. (2009) A Meta-RaPS for the early/tardy single machine scheduling problem International Journal of Production Research. 47: 1717-1732
Lan G, DePuy GW, Whitehouse GE. (2007) An effective and simple heuristic for the set covering problem European Journal of Operational Research. 176: 1387-1403
Lan G, DePuy GW. (2006) On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem Computers and Industrial Engineering. 51: 362-374
DePuy GW, Moraga RJ, Whitehouse GE. (2005) Meta-RaPS: a simple and effective approach for solving the traveling salesman problem Transportation Research Part E-Logistics and Transportation Review. 41: 115-130
Taylor GD, Whyte TC, DePuy GW, et al. (2005) A simulation-based software system for barge dispatching and boat assignment in inland waterways Simulation Modelling Practice and Theory. 13: 550-565
Moraga RJ, DePuy GW, Whitehouse GE. (2005) Meta-RaPS approach for the 0-1 Multidimensional Knapsack Problem Computers & Industrial Engineering. 48: 83-96
Ralston P, DePuy G, Graham JH. (2004) Graphical enhancement to support PCA-based process monitoring and fault diagnosis. Isa Transactions. 43: 639-53
DePuy GW, Taylor GD, Whyte TC. (2004) Barge fleet layout optimization International Journal of Computer Integrated Manufacturing. 17: 97-107
Depuy GW, Whitehouse GE. (2001) A simple and effective heuristic for the resource constrained project scheduling problem International Journal of Production Research. 39: 3275-3287
See more...