Abstract
In this paper, we study bicriteria order acceptance and scheduling with consideration of fill rate in a parallel-machine environment. In our scheduling model, either the number of orders being rejected, or the total processing time of the orders being rejected, is not allowed to be greater than a given value, so that a specific constraint of order fill rate is satisfied. We present efficient approximation algorithms with a performance ratio arbitrarily approaching 4/3.
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.
