An enhanced ABC algorithm for single machine order acceptance and scheduling with class setups

• This paper studies the order acceptance and scheduling problem with class setups in a single machine environment.
• An enhanced artificial bee colony algorithm is proposed for solving this problem.
• Experimental results reveal that the proposed algorithm is both computationally efficient and effective.

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.

Figure optionsDownload as PowerPoint slide