2018
DOI: 10.1504/ijista.2018.091588
|View full text |Cite
|
Sign up to set email alerts
|

Simultaneous scheduling of jobs, machines and tools considering tool transfer times in multi-machine FMS using new nature-inspired algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…Sivarami Reddy N et al (2017a) suggested a CSA to solve machines and tools simultaneous scheduling with a copy of every type of tools to produce optimal sequences in a MMFMS for minimization of makespan and it is shown that CSA outperforms current algorithms. Sivarami Reddy et al (2017b) suggested 3 nature inspired algorithms viz FPA, SOSA and CSA to solve machines and tools simultaneous scheduling through a copy of every tool's type to produce optimal sequences in a MMFMS for minimization of MSN and shown that FPA outperforms the other proposed algorithms and existing algorithms. Beezao et al (2017) modeled and addressed the identical parallel machines problem with tooling constraints for minimizing MS using an adaptive large neighborhood search metaheuristic(ALNS).…”
Section: I1 Literature Reviewmentioning
confidence: 99%
“…Sivarami Reddy N et al (2017a) suggested a CSA to solve machines and tools simultaneous scheduling with a copy of every type of tools to produce optimal sequences in a MMFMS for minimization of makespan and it is shown that CSA outperforms current algorithms. Sivarami Reddy et al (2017b) suggested 3 nature inspired algorithms viz FPA, SOSA and CSA to solve machines and tools simultaneous scheduling through a copy of every tool's type to produce optimal sequences in a MMFMS for minimization of MSN and shown that FPA outperforms the other proposed algorithms and existing algorithms. Beezao et al (2017) modeled and addressed the identical parallel machines problem with tooling constraints for minimizing MS using an adaptive large neighborhood search metaheuristic(ALNS).…”
Section: I1 Literature Reviewmentioning
confidence: 99%
“…Narapureddy et al [11] addressed the MC and tool joint scheduling problems with one copy of every tool variety considering the tool transfer times between MCs for the minimum C max and demonstrated that tool transfer times had a substantial impact on the C max . Job transfer times were not considered.…”
Section: Introductionmentioning
confidence: 99%