Abstract
An optimal polynomial time solution for minimum makespan on a single machine with linear job deterioration is known in the scheduling literature for about 20 years (Browne and Yechiali, 1990 [1]). An extension of this result to flow-shop settings has not been published since then. In this note we provide this result: we show that the Browne–Yechiali sequence remains optimal for flow-shops, i.e. we present a polynomial time (O(nlogn)) solution for minimum makespan on an m-machine flow-shop with linear job deterioration.
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.
