Abstract
This paper considers some scheduling problems with deteriorating jobs and learning effects. The following objective functions are considered: the makespan, the total completion times, and the total absolute differences in completion times. Several polynomial time algorithms are proposed to optimally solve the single-machine scheduling problems. Finally, we show that several special cases of the flowshop scheduling problems remain polynomially solvable under the proposed model.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.