Abstract
This paper explores incompatible batch scheduling with common due date on a single batch processing machine. The problem of minimizing the number of tardy jobs is proved to be NP-hard with respect to id-encoding, and pseudo-polynomial time algorithms for minimizing the number of tardy jobs and the weighted number of tardy jobs are presented, respectively.
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.
