Abstract
This paper deals with the bin packing problem and the multiprocessor scheduling problem both with an additional constraint specifying the maximum number of jobs in each type to the processed on a processor. Since these problems are NP-complete, various approximation algorithms are proposed by generalizing those algorithms known for the ordinary bin packing and multiprocessor scheduling problems. The worst-case performance of the proposed algorithms are analyzed, and some computational results are reported to indicate their average case behavior.
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.
