Minimum cost multi-product flow lines

Arianna Alfieri

doi:10.1007/s10479-006-0151-3

2006-12-21

PRE

Arianna Alfieri *

Gaia Nicosia

DOI：10.1007/s10479-006-0151-3

原文链接

原文求助

摘要

En 中文

In this paper, the problem of finding the minimum cost flow line able to produce different products is considered. This problem can be formulated as a shortest path problem on an acyclic di-graph when the machines graph associated with each product family is a chain or a comb. These graphs are relevant in production planning when dealing with pipelined assembly systems. We solve the problem using A* algorithm which can be efficiently exploited when there is a good estimate on the value of an optimal solution. Therefore, we adapt a known bound for the Shortest Common Supersequence problem to our case and show the effectiveness of the approach by presenting an extensive computational experience.

Keyword:

flow lines optimization

shortest path algorithms

期刊

Annals of Operations Research

IF:

4.5

论文数:

8.0K

被引数:

2.1W

机构

暂无机构信息

引用论文

Structure, processes, and initial outcomes of The Ottawa Hospital Multi‐Specialist Limb‐Preservation Clinic and Programme: A unique‐in‐Canada quality improvement initiative 结构、流程及初步结果：The Ottawa Hospital Multi‐Specialist Limb‐Preservation Clinic and Programme：一项unique‐in‐Canada的质量改进倡议

International Wound Journal

IF0

2021-06-03

OAAI

Derek J. Roberts; Christine Murphy; Shira A. Strauss; Timothy Brandys; Vicente Corrales‐Medina; Jing Zhang; Karl‐André Lalonde; Bradley Meulenkamp; Alison Jennings; Alan J. Forster; Daniel I. McIsaac; Sudhir K. Nagpal

Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间？

Hearing Research

IF0

2012-08-01

PREAI

Boaz M. Ben-David; Vania Y.Y. Tse; Bruce A. Schneider

THEORY AND ALGORITHMS FOR PLAN MERGING

artificial intelligence review

IF4.6

1992-10-01

PREAI

FOULSER, DE; LI, M; YANG, Q