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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
