返回
An optimization-based heuristic for the robotic cell problem
DOI:10.1016/j.ejor.2009.06.035.png)
摘要
En 中文
This study investigates an optimization-based heuristic for the robotic cell problem. This problem arises in automated cells and is a complex flow shop problem with a single transportation robot and a blocking constraint. We propose an approximate decomposition algorithm. The proposed approach breaks the problem into two scheduling problems that are solved sequentially: a flow shop problem with additional constraints (blocking and transportation times) and a single machine problem with precedence constraints, time lags, and setup times. For each of these problems, we propose an exact branch-and-bound algorithm. Also, we describe a genetic algorithm that includes, as a mutation operator, a local search procedure. We report the results of a computational study that provides evidence that the proposed optimization-based approach delivers high-quality solutions and consistently outperforms the genetic algorithm. However, the genetic algorithm delivers reasonably good solutions while requiring significantly shorter CPU times. (C) 2009 Published by Elsevier B.V.
Keyword:
Flow shop
Robotic cell
Blocking
Branch-and-bound
Genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
How do associations between sleep duration and metabolic health differ with age in the UK general population?
PLOS ONE
IF0
The healing of N-vacancy in boron nitride nanotube by using NO and NO2 molecules: a density functional theoretical study利用NO和NO2分子修复氮化硼纳米管中N空位的密度泛函理论研究
RSC Advances
IF0
Induction and elimination of bulky benzo[a]pyrene-related DNA adducts and 8-oxodGuo in mussels Mytilus galloprovincialis exposed in vivo to B[a]P-contaminated feed体内暴露于B[a]P污染的饲料中的贻贝Mytilus galloprovincialis中庞大的苯并 [a] re相关DNA加合物和8-氧代果的诱导和消除

