The Line Segmentation Problem

DOI10.1287/OPRE.39.1.42MaRDI QIDQ3981508zbMATH OpenOpenAlexFDO

Authors Hirofumi Matsuo, Reza Ahmadi

Publication date 26 June 1992

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.39.1.42

zbMATH Keywords

heuristicsNP-completenessquadratic integer programmingLower bounding proceduresmultistage, multimachine production system

Mathematics Subject Classification ID

Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30)

Recommendations

• Line configuration to minimize setup costs
• scientific article; zbMATH DE number 4012297
• scientific article; zbMATH DE number 2062240
• Production planning in automated manufacturing

Cited in

(7)

• Design of electronic assembly lines: An analytical framework and its application
• New numerical algorithms to optimize cutting operations of a five-axis milling machine
• Grid generation as applied to optimize cutting operations of the five-axis milling machine.
• A mini-line approach for pull production
• Line configuration to minimize setup costs
• Batch-size-based rearrangement of the shop floor into mini-lines
• Laslett's line segment problem

This page was built for publication: The Line Segmentation Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3981508)