A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility
From MaRDI portal
(Redirected from Publication:1909008)
Recommendations
- Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- An analogue genetic algorithm for solving job shop scheduling problems
- Using genetic algorithm in two-machine flexible flow-shop scheduling with setup times
Cites work
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- A genetic algorithm for the job shop problem
- Job Shop Scheduling by Simulated Annealing
- Simulated annealing for resource-constrained scheduling
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
Cited in
(8)- JOB SEQUENCING IN AN EVOLUTIONARY PARADIGM
- A genetic algorithm for the multi-class contingent bidding model
- The application of genetic algorithms to lot streaming in a job-shop scheduling problem
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines
- Artificial Evolution
- Using genetic algorithm in two-machine flexible flow-shop scheduling with setup times
- Metaheuristics: A bibliography
This page was built for publication: A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1909008)
