Solving nonstandard job-shop scheduling problem with due dates using bounding genetic algorithm

According to the features of a non-standard job-shop scheduling problem with due dates, using the reverse scheduling policy, a initial algorithm based on priority values is presented in this paper, and the operators of the bounding genetic algorithm are constructed. Demonstration and judgement of the deadlock are also proposed. The experiment result shows that the algorithm presented is effective and can converge faster.