Abstract
In the two-agent scheduling with the global objective function to be minimized being the number of tardy jobs and the specified agent’s objective function to be minimized being makespan or maximum lateness, the computational complexities of four problems were posed as open in the literature. We show in this paper that the four problems are binary NP-hard and two of them are solvable in pseudo-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
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.
