𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Modelling a tool switching problem on a single NC-machine

✍ Scribed by Caroline Privault; Gerd Finke


Publisher
Springer US
Year
1995
Tongue
English
Weight
750 KB
Volume
6
Category
Article
ISSN
0956-5515

No coin nor oath required. For personal study only.

✦ Synopsis


The problem addressed in this paper is a tool switching problem on a single numerically controlled machine. In the first part, the sequence of jobs is given and the tooling aspect is dealt with: the uniform case where all switching times are equal is described, and a model for the general nonuniform case is proposed. This problem is reduced to the problem of finding a minimum cost flow of maximum value in an acyclic network. The second part is devoted to the tool management scheduling problem. Some heuristics are presented and computational results are given and analyzed.


πŸ“œ SIMILAR VOLUMES


On a single-machine optimal constant due
✍ TCE Cheng πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 164 KB

This paper considers the problem of optimal constant due-date assignment and sequencing of jobs in a single-machine shop. We formulate the problem as a general constrained optimization problem and apply the Kuhn-Tucker conditions to find the optimal solution which is shown to be independent of the j

Rough and finish tool-path generation fo
✍ Z. Yin πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 283 KB

Progressive fitting and multiresolution tool path generating techniques are proposed in this paper, by which multi-level (LOD) models fitting for different subsets of sampled points are obtained, and then multiresolution rough-cut and finish-cut tool paths are generated based on the LOD models. The

A note on β€œBeam search heuristics for th
✍ F. Della Croce; E. Desmier; T. Garaix πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 171 KB

In a recent paper by Valente ''Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time" ', Computers & Industrial Engineering, 55, 663-675, 2008, several beam search approaches are compared on a large set of instances of the total weighted earlinesstard

Two due date assignment problems with po
✍ Chou-Jung Hsu; Suh-Jenq Yang; Dar-Li Yang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 193 KB

The focus of this study is to analyze single-machine scheduling and due date assignment problems with position-dependent processing time. Two generally positional deterioration models and two frequent due date assignment methods are investigated. The objective functions include the cost of changing