Improving genetic algorithm performance by population initialisation with dispatching rules
Authors:
- Ivan VlašićIVIvan Vlašić
- Marko ÐurasevićMÐMarko Ðurasević
- Domagoj JakobovićDJDomagoj Jakobović
- 1 November 2019
- journal article
- research article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 137
Abstract
No abstract availableKeywords
This publication has 55 references indexed in Scilit:
- Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithmExpert Systems with Applications, 2009
- A new paradigm for rule-based scheduling in the wafer probe centreInternational Journal of Production Research, 2008
- A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problemsComputers & Industrial Engineering, 2007
- Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop schedulingIEEE Transactions on Evolutionary Computation, 2003
- A New Heuristic Optimization Algorithm: Harmony SearchSIMULATION, 2001
- Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisonsIEEE Transactions on Evolutionary Computation, 2000
- A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategiesComputers & Industrial Engineering, 1999
- A heuristic to minimize the total weighted tardiness with sequence-dependent setupsIIE Transactions, 1997
- A tutorial survey of job-shop scheduling problems using genetic algorithms—I. representationComputers & Industrial Engineering, 1996
- A genetic algorithm for multiprocessor schedulingIEEE Transactions on Parallel and Distributed Systems, 1994