Abstract
This paper considers the order acceptance and scheduling problem in a single machine environment where each customer order is characterized by a known processing time, due date, revenue, and class setup time. The objective is to maximize the total revenue. Since the problem is computationally intractable, we first conduct a preliminary study of applying the basic artificial bee colony algorithm to address the problem under study. Specifically, we design appropriate neighborhood operators with respect to the problem. Based on the results of the preliminary study and the problem characteristics, an enhanced artificial bee colony algorithm is developed with a series of modifications. The extensive experimental results indicate that the enhanced artificial bee colony algorithm is both computationally efficient and effective for large sized problem instances.
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.
