2000
DOI: 10.1080/095372800232496
|View full text |Cite
|
Sign up to set email alerts
|

A generalized procedure for minimizing tool changeovers of two parallel and identical CNC machining centres

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2004
2004
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…Each machine has its own capacity and tool set, so the objective is to find the sequence that minimises the number of tool switches for all machines. Khan et al (2000) present a greedy heuristic for the SSP with two identical parallel machines. Fathi and Barnette (2002) present three heuristics for multiple parallel machines; an improvement procedure tested for combinations of different local search strategies (insertion and exchange) was compared to a list processing heuristic (LPT) and a constructive heuristic that starts with an MSG heuristic for the corresponding single-machine problem and then generates a subsequence for each machine.…”
Section: Variations With Multiple Machinesmentioning
confidence: 99%
See 1 more Smart Citation
“…Each machine has its own capacity and tool set, so the objective is to find the sequence that minimises the number of tool switches for all machines. Khan et al (2000) present a greedy heuristic for the SSP with two identical parallel machines. Fathi and Barnette (2002) present three heuristics for multiple parallel machines; an improvement procedure tested for combinations of different local search strategies (insertion and exchange) was compared to a list processing heuristic (LPT) and a constructive heuristic that starts with an MSG heuristic for the corresponding single-machine problem and then generates a subsequence for each machine.…”
Section: Variations With Multiple Machinesmentioning
confidence: 99%
“…model/ solution approach Bard (1988) math. model NLP Khan et al (2000) heuristic Greedy Fathi and Barnette (2002) heuristic construction and improvement heuristics, LPT Ghrayeb, Phojanamongkolkij, and Finch (2003) math. model, heuristic NLP/construction heuristics Van Hop and Nagarur (2004) math.…”
Section: Referencesmentioning
confidence: 99%