A genetic algorithm for machine scheduling problem under shared resource constraints

In this paper, we present a popular machine scheduling problem with resource constraints in manufacturing engineering. A genetic algorithm based approach is put forward and illustrated, including a specialized encoding and two kinds of decoding greedy schemes. Compared with both several kinds of lower bounds we present in this paper and the results from ILOG OPL software package, it is shown that our rapid genetic algorithm achieved significant results with stable and near-optimal performance