Algorithm generating initial population of schedules for population-based algorithms solving flexible job shop problems
From MaRDI portal
Publication:4972148
DOI10.7546/CRABS.2019.06.01zbMATH Open1438.90132MaRDI QIDQ4972148FDOQ4972148
Authors: Vassil Guliashki, Leoneed Kirilov 
Publication date: 22 November 2019
Recommendations
- A genetic algorithm for the flexible job-shop scheduling problem
- Solving flexible job shop scheduling problem by genetic algorithm
- Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem
- Flexible job-shop scheduling problem solved by improved artificial immune algorithm
- Research on flexible job shop scheduling problem based on improved multi-population genetic algorithm
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic scheduling theory in operations research (90B36)
This page was built for publication: Algorithm generating initial population of schedules for population-based algorithms solving flexible job shop problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972148)
