Feature-based initial population generation for the optimization of job shop problems
- 29 September 2010
- journal article
- Published by Zhejiang University Press in Journal of Zhejiang University SCIENCE C
- Vol. 11 (10), 767-777
- https://doi.org/10.1631/jzus.c0910707
Abstract
A suitable initial value of a good (close to the optimal value) scheduling algorithm may greatly speed up the convergence rate. However, the initial population of current scheduling algorithms is randomly determined. Similar scheduling instances in the production process are not reused rationally. For this reason, we propose a method to generate the initial population of job shop problems. The scheduling model includes static and dynamic knowledge to generate the initial population of the genetic algorithm. The knowledge reflects scheduling constraints and priority rules. A scheduling strategy is implemented by matching and combining the two categories of scheduling knowledge, while the experience of dispatchers is externalized to semantic features. Feature similarity based knowledge matching is utilized to acquire the constraints that are in turn used to optimize the scheduling process. Results show that the proposed approach is feasible and effective for the job shop optimization problem.Keywords
This publication has 14 references indexed in Scilit:
- A bicriteria parallel machine scheduling with a learning effect of setup and removal timesApplied Mathematical Modelling, 2009
- A genetic algorithm for the Flexible Job-shop Scheduling ProblemComputers & Operations Research, 2008
- An improved genetic algorithm with initial population strategy and self-adaptive member groupingComputers & Structures, 2008
- Semantics of Schedules for the Fuzzy Job-Shop ProblemIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2008
- An improved genetic algorithm for job-shop scheduling problems using Taguchi-based crossoverThe International Journal of Advanced Manufacturing Technology, 2007
- Solution of job‐shop scheduling problems by an idle time shortening genetic algorithmElectrical Engineering in Japan, 2007
- Tuning the Structure and Parameters of a Neural Network by Using Hybrid Taguchi-Genetic AlgorithmIEEE Transactions on Neural Networks, 2006
- Guided Local Search with Shifting Bottleneck for Job Shop SchedulingManagement Science, 1998
- Scheduling AlgorithmsPublished by Springer Science and Business Media LLC ,1995
- Algorithms for Solving Production-Scheduling ProblemsOperations Research, 1960