This paper investigates the linearization of right node raising constructions (e.g., Darius found and Jasmine took the book). It finds that right node raising constructions can be linearized through an extension of Fox & Pesetsky's (2005) Cyclic Linearization, termed Flexible Cyclic Linearization. In both proposals, linearization of syntactic structure happens in phases and obeys the property of Order Preservation: linear ordering statements established in a new phase cannot contradict those established in a previous phase. However, Cyclic Linearization and Flexible Cyclic Linearization crucially differ in that the latter permits ordering statements to be deleted in the phase in which they arise as necessary to linearize the syntactic object. Flexible Cyclic Linearization correctly linearizes right node raising constructions, and predicts those properties of right node raising that relate to linearization. In general, because it relies on the deletion of ordering statements, Flexible Cyclic Linearization can linearize parallel structures without adopting a specific algorithm for the generation of ordering statements.