A novel bi-vector encoding genetic algorithm for the simultaneous multiple resources scheduling problem

doi:10.1007/s10845-011-0570-0

A novel bi-vector encoding genetic algorithm for the simultaneous multiple resources scheduling problem

2011-07-27

52

PRE

AI

DOI：10.1007/s10845-011-0570-0

Original

Original request for help

Save

Abstract

En 中文

To improve capital effectiveness in light of demand fluctuation, it is increasingly important for high-tech companies to develop effective solutions for managing multiple resources involved in the production. To model and solve the simultaneous multiple resources scheduling problem in general, this study aims to develop a genetic algorithm (bvGA) incorporating with a novel bi-vector encoding method representing the chromosomes of operation sequence and seizing rules for resource assignment in tandem. The proposed model captured the crucial characteristics that the machines were dynamic configuration among multiple resources with limited availability and sequence-dependent setup times of machine configurations between operations would eventually affect performance of a scheduling plan. With the flexibility and computational intelligence that GA empowers, schedule planners can make advanced decisions on integrated machine configuration and job scheduling. According to a number of experiments with simulated data on the basis of a real semiconductor final testing facility, the proposed bvGA has shown practical viability in terms of solution quality as well as computation time.

Keywords:

Total resource management

Manufacturing management

Flexible manufacturing systems

Scheduling

Genetic algorithm

A novel bi-vector encoding genetic algorithm for the simultaneous multiple resources scheduling problem

Abstract

Journal

Organization