A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility

DOI10.1007/BF01719263zbMath0842.90063MaRDI QIDQ1909008

Ossama Kettani, Étienne Mayrand, Pierre Lefrançois, Marie-Hélène Jobin

Publication date: 7 March 1996

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

job schedulingsequence dependent setup costsgenetic search algorithmpopulation management strategies

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue ⋮ Metaheuristics: A bibliography

Uses Software

• Tabu search

Cites Work

• Simulated annealing for resource-constrained scheduling
• A genetic algorithm for the job shop problem
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
• Job Shop Scheduling by Simulated Annealing
• Unnamed Item
• Unnamed Item

This page was built for publication: A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility