Abstract
We study an order acceptance and scheduling problem with batch delivery in a supply chain consisting of a manufacturer and a customer. The manufacturer can rejects some orders placed by the customer, and processes the others on parallel machines and then delivers them to the customer in batches. The objective is to minimize the weighted sum of the maximum lead time of the accepted orders and the total cost of rejecting and delivering orders. We develop two approximation algorithms for this NP-hard problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.