Abstract
This paper considers the single-machine scheduling problems with learning effect and deteriorating jobs. Release time of jobs is a positive and strictly decreasing function about resource consumption. The optimal algorithm is presented for the problem to minimize the makespan with the total resource consumption constraints. Then, for a given sequence, we propose an optimal solution for the problem to minimize the total resource consumption with the makespan constraints.
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 callMore From: The International Journal of Advanced Manufacturing Technology
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.
