It is known that rapid single-flux-quantum (RSFQ) circuit technology and its energy-efficient derivatives are considered promising technology in superconducting digital applications. Given an <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula> -stage logical netlist with a set of logic gates and D-type flip-flops (DFFs) in an RSFQ circuit, based on the construction of three different gate components inside one gate column, the RSFQ circuit can be treated as a pipelined architecture with <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> gate components inside <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula> gate columns. To minimize the routing area in the pipelined architecture of an RSFQ circuit, an efficient algorithm can be proposed to minimize the total vertical wirelength in a fixed-order placement. First, based on the construction of the initial fixed-order placement and the reduction of the total vertical minimum length using one upward-shifting operation, a propagation-based fixed-order placement (PFP) can be obtained by using an on-column placement process. Based on the determination of the available gate clusters inside the gate columns, an iterative matching-based shifting process can be further used to reduce the total vertical wirelength in a fixed-order placement. Finally, based on the determination of the available gate blocks in a modified fixed-order placement, an iterative shifting process can be used to reduce the total vertical wirelength in the modified fixed-order placement. Compared with the modified simulated-annealing (SA)-based algorithm with three initial temperatures, 100, 1000, and 100000, the experimental results show that our proposed algorithm can use 3.4%, 2.7%, and 2.1% of CPU time to reduce 3.5%, 0.5%, and 0.3% of the total vertical wirelength in a final fixed-order placement for five tested RSFQ circuits on the average, respectively. Clearly, the proposed algorithm is efficient in the construction of a fixed-order placement in an RSFQ circuit.