Abstract
This note considers no-idle permutation flowshop scheduling problems with time-dependent learning effect and deteriorating jobs. The objective functions are to minimize the makespan and the total (weighted) completion time, respectively. Low and Lin [1], showed that an optimal sequence for these problems can be solved in polynomial time. We demonstrate these results to be incorrect by counter-examples for the no-idle permutation flowshop scheduling problems with an increasing series of dominating machines (idm), then introduce new exact solution algorithms that polynomially solve these problems.
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.
