
This paper presents an algorithm for efficiently sequencing the cutting operations associated with the manufacture of discrete parts on a CNC machine. The problem is first modeled as an integer program but recast via Lagrangian relaxation as a min-cut problem on a bipartite network. Tight lower bounds are obtained with a max-flow algorithm. The corresponding solution is used as input to a greedy heuristic which generates “good” feasible points. Given nonconvergence, a branch and bound strategy is used to find the optimal solution.
bipartite network, Lagrangian relaxation, flexible manufacturing systems, integer programming, Lagrangian relaxation, branch and bound, computer-aided process planning, Deterministic scheduling theory in operations research, cutting operations, Integer programming, sequencing, max-flow algorithm, greedy heuristic, Numerical mathematical programming methods, branch and bound, Deterministic network models in operations research, Production models, computer-aided process planning
bipartite network, Lagrangian relaxation, flexible manufacturing systems, integer programming, Lagrangian relaxation, branch and bound, computer-aided process planning, Deterministic scheduling theory in operations research, cutting operations, Integer programming, sequencing, max-flow algorithm, greedy heuristic, Numerical mathematical programming methods, branch and bound, Deterministic network models in operations research, Production models, computer-aided process planning
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 34 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
