Hybrid evolutionary approaches for the single machine order acceptance and scheduling problem

Abstract

This paper presents two hybrid metaheuristic approaches, viz. a hybrid steady-state genetic algorithm (SSGA) and a hybrid evolutionary algorithm with guided mutation (EA/G) for order acceptance and scheduling (OAS) problem in a single machine environment where orders are supposed to have release dates and sequence dependent setup times are incurred in switching from one order to next in the schedule. OAS problem is an NP-hard problem. We have compared our approaches with the state-of-the-art approaches reported in the literature. Computational results show the effectiveness of our approaches.