A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 702365 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- A generalized permutation approach to job shop scheduling with genetic algorithms
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Deterministic job-shop scheduling: Past, present and future
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Evolution based learning in a job shop scheduling environment
- Job Shop Scheduling by Local Search
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
- Some new results on simulated annealing applied to the job shop scheduling problem
- The job shop scheduling problem: Conventional and new solution techniques
- The use of genetic algorithms to solve the economic lot size scheduling problem
Cited in
(8)- A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems
- Multiple colony ant algorithm for job-shop scheduling problem
- An effective architecture for learning and evolving flexible job-shop schedules
- Genetic tabu search for the fuzzy flexible job shop problem
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
- A dynamic WIP control strategy for bottlenecks in a wafer fabrication system
- scientific article; zbMATH DE number 1727369 (Why is no real title available?)
This page was built for publication: A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869426)