Shuffled frog-leaping algorithm for order acceptance and scheduling in flow shop

Order acceptance and scheduling problem is considered in a flow shop where the objective is to decide on the orders to accept and schedule the accepted orders so as to maximize total net revenue. An effective shuffled frog-leaping algorithm (SFLA) is proposed, in which population is divided into memeplexes using tournament selection and the search process within each memeplex is done on the best solution of the memeplex. We assess the performance of SFLA using an extensive set of instances. The experimental results show that SFLA can provide the promising results on the considered problems.