Abstract
In this paper, we consider two and three identical parallel machine scheduling problems which are desired to minimize two criteria, maximum completion time and maximum lateness. We exploit the Sahni's algorithm for our bi-criteria problem and give the entire trade off curve of schedule, which are nondominated for two criteria.
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
