Abstract
The bump number b( P) of a partial order P is the minimum number of comparable, consecutive pairs of elements in a linear extension of P. We show the strong connection between the bump number problem and flow-shop scheduling problems: bumps in a permutation schedule “bump” the schedule by a fixed amount of time, and finding b( P) is equivalent to a 2-machine flow-shop problem with precedence constraints. We also show that if jobs have equal processing times on each machine then there is an optimal permutation schedule for the flow-shop with precedence constraints.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
