Abstract
In this paper, three single-machine scheduling problems with time-dependent learning effect model to minimize the sum of weighted completion times, the sum of the k th powers of completion times and the maximum lateness are investigated. We show that the shortest processing time first (SPT) rule is an optimal solution for the problem to minimize the sum of the k th powers of completion times. Some polynomial time solutions are provided for the other two problems under certain conditions, respectively.
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.
