Abstract
This note revisits single machine due-date assignment scheduling with job-dependent learning effects and resource allocation. Under the convex decreasing resource consumption function, the problem is to minimize the scheduling cost subject to a constraint on the total weighted resource consumption cost. Firstly, it is shown that the published results are incorrect by a counter-example from the literature. Then the corrected results are provided, and it is shown that this problem can be solved in polynomial time.
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.