Investigating the use of genetic programming for a classic one-machine scheduling problem
From MaRDI portal
Recommendations
Cited in
(12)- Using genetic algorithms for single-machine bicriteria scheduling problems
- Simplifying dispatching rules in genetic programming for dynamic job shop scheduling
- Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints
- Generation of time-delay algorithms for anti-air missiles using genetic programming
- Designing dispatching rules to minimize total tardiness
- Multi-objective optimization of manufacturing cell design
- scientific article; zbMATH DE number 1234080 (Why is no real title available?)
- Co-evolutionary genetic algorithm for multi-machine scheduling: Coping with high performance variability
- Evolving knowledge for the solution of clustering problems in cellular manufacturing
- Consultation sequencing of a hospital with multiple service points using genetic programming
- Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling
- A cooperative coevolutionary genetic programming hyper-heuristic for multi-objective makespan and cost optimization in cloud workflow scheduling
This page was built for publication: Investigating the use of genetic programming for a classic one-machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1852227)