Abstract
This paper explores scheduling to a common due date on unrelated machines with resource allocation and deteriorating jobs. The main purpose is to determine the optimal resource allocation and the optimal job sequence so that the cost function that includes the sum of earliness, tardiness, and resource cost will be minimized. Result showed that the problem is polynomial time solvable when the number of machine is fixed.
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.
