Note---Operations Sequencing in Discrete Parts Manufacturing

Jonathan F. Bard and Thomas A. Feo
Additional contact information
Jonathan F. Bard: Operations Research Group, Department of Mechanical Engineering, University of Texas, Austin, Texas 78712
Thomas A. Feo: Operations Research Group, Department of Mechanical Engineering, University of Texas, Austin, Texas 78712

Management Science, 1989, vol. 35, issue 2, 249-255

Abstract: 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.

Keywords: flexible manufacturing systems; integer programming; Lagrangian relaxation; branch and bound; computer-aided process planning (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.35.2.249 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:35:y:1989:i:2:p:249-255

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().