Imran Nasim, Michael E. Henderson
Mathematics
Let (X, <) be a partially ordered set. A linear extension x1, x2, ... has a bump whenever xi<xi+1, and it has a jump whenever xiand xi+1are incomparable. The problem of finding a linear erxtension that minimizes the number of jumps has been studied extensively; Pulleyblank shows that it is NP-complete in the general case. Fishburn and Gehrlein raise the question of finding a linear extension that minimizes the number of bumps. We show that the bump number problem is closely related to the well-studied problem of scheduling unit-time tasks with a precedence partial order on two identical processors. We point out that a variant of Gabow's linear-time algorithm for the two-processor scheduling problem solves the bump number problem. Habib, Möhring, and Steiner have independently discovered a different polynomial-time algorithm to solve the bump number problem. © 1988 Kluwer Academic Publishers.
Imran Nasim, Michael E. Henderson
Mathematics
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering