A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility
From MaRDI portal
Publication:1909008
DOI10.1007/BF01719263zbMATH Open0842.90063MaRDI QIDQ1909008FDOQ1909008
Authors: Étienne Mayrand, Pierre Lefrançois, Ossama Kettani, Marie-Hélène Jobin
Publication date: 7 March 1996
Published in: OR Spektrum (Search for Journal in Brave)
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
job schedulingsequence dependent setup costsgenetic search algorithmpopulation management strategies
Cites Work
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
Uses Software
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)