OPTIMAL TOOL MODULE DESIGN PROBLEM FOR NC MACHINE TOOLS

DOI10.15807/jorsj.27.205zbMath0552.90066OpenAlexW2727200828MaRDI QIDQ3346089

Hisatoshi Suzuki, Noboru Tsuchiya, R. Hirabayashi

Publication date: 1984

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.27.205

zbMATH Keywords

upper boundbipartite graphNP-completenessproduction planningset coveringbranch and bound algorithmLagrange relaxationprimal dual algorithm0-1 integer linear programmingdepth first tree searchoptimal tool module design

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09)

Related Items (7)

A pegging approach to the precedence-constrained knapsack problem ⋮ A column generation approach to job grouping for flexible manufacturing systems ⋮ Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems ⋮ Tool-feeder partitions for module assignment in PCB assembly ⋮ The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems ⋮ Heuristic and exact algorithms for the precedence-constrained knapsack problem

This page was built for publication: OPTIMAL TOOL MODULE DESIGN PROBLEM FOR NC MACHINE TOOLS