Abstract
Two problems of bicriterion scheduling of jobs with identical processing times by uniform processors are considered. The first criterion is the minimization of maximum cost with different cost functions, while the second criterion is the minimization of either total or maximum costs. Polynomial time algorithms are presented to determine all efficient solutions for both problems.
Sign-in/Register to access full text options 
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.
