the goal of project crashing is to complete a project by an earlier deadline at minimum cost. Crashing a project manually can be quite tedious, especially to projects of realistic sizes. Formulating a problem of project crashing as a linear or nonlinear programming problem, and using Excel Solver to solve the problem provides an efficient computerized approach. Ragsdale (2003) argued that the LP-Solver approach for project crashing is still the most reliable approach to analyzing cost-time tradeoffs in a project. Mantel et. al (2011) demonstrated the use of Excel Solver to facilitate choosing the activities to crash in project crashing. The network diagram in their approach is based on AOA (activity-on-arrow) networks. However, the construction of an AOA network is often very problematic, due to difficulties in identifying and applying dummy activities (Cohen & Sadeh, 2007; Kim, 2008). In addition, event time of nodes needs to be defined in an AOA network, in order to specify the precedence relationships and to determine the project completion time (Mantel et. al, 2011). It is quite tedious in setting up the corresponding constraints in Excel Solver. Thus, dummy activities and complex constraints for precedence relationships are major drawbacks in the Solver approach using AOA networks, especially as the number of activities increase. This paper shows a new and efficient way for project crashing using Excel Solver, by introducing an AON (activity-on-node) network approach. The new approach is easier to understand, to construct, and to apply.