Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
1995 | 10.1007/BF00123680 | Journal of Intelligent Manufacturing |
Keywords | Field | DocType |
Tool management,scheduling,mini-cost flow,heuristics | Mathematical optimization,Tool management,Simulation,Computer science,Scheduling (computing),Flow shop scheduling,Two-level scheduling,Electronic engineering,Nurse scheduling problem,Rate-monotonic scheduling,Dynamic priority scheduling,Round-robin scheduling | Journal |
Volume | Issue | ISSN |
6 | 2 | 0956-5515 |
Citations | PageRank | References |
17 | 1.51 | 6 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Caroline Privault | 1 | 25 | 3.07 |
Gerd Finke | 2 | 181 | 15.63 |