Production scheduling of grouped jobs has been an active research area since GT (Group Technology) was widely applied in practical manufacturing systems. To minimize the total Β―owtime of grouped jobs on a single machine, we combine jobs into fundamental runs based upon the necessary condition of the
A modified genetic algorithm for single machine scheduling
β Scribed by Jiyin Liu; Lixin Tang
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 301 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0360-8352
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we propose a modified genetic algorithm for the single machine scheduling problem with ready times. This algorithm improves the simple genetic algorithm by introducing two new steps: (1) a filtering step to filter out the worst solutions in each generation and fill in their positions with the best solutions of previous generations; and (2) a selective cultivation step to cultivate the most promising individual when no improvement is made for certain generations. Improvement is also made on the crossover operation for the problem. Computational experiments are carried out, comparing the performance of the proposed algorithm, the simple genetic algorithm and special purpose heuristics. The contribution of each modification measure to the performance improvement is also analyzed.
π SIMILAR VOLUMES
Despite the inter-dependent relationship between them, production scheduling and preventive maintenance planning decisions are generally analyzed and executed independently in real manufacturing systems. This practice is also found in the majority of the studies found in the relevant literature. In