1. Duplicate Genetic Algorithm for Scheduling a Bi-Objective Flexible Job Shop Problem

H. Mohammadi-Andargoli; R. Tavakkoli-Moghaddam; N. Shahsavari Pour; M.H. Abolhasani-Ashkezari

Volume 1, Issue 2 , July 2012, , Pages 10-26

Abstract
  This paper addresses the permutation of a flexible job shop problem that minimizes the makespan and total idleness as a bi-objective problem. This optimization problem is an NP-hard one because a large solution space allocated to it. We use a duplicate genetic algorithm (DGA) to solve the problem, which ...  Read More