2014
DOI: 10.1080/00207543.2014.910628
|View full text |Cite
|
Sign up to set email alerts
|

A tabu search algorithm for simultaneous machine/AGV scheduling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
68
0
1

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 99 publications
(73 citation statements)
references
References 21 publications
4
68
0
1
Order By: Relevance
“…Simultaneously, scheduling of machines and AGV is the only means of ensuring the validity of all the individual schedules [2]. Algorithms in the literature that simultaneously schedule jobs and AGVs alone while ignoring AGVs routing and dispatching includes single objective approach [13][14][15][16][17][18] and multiple objective approach [19,20]. Bilge and Ulusoy [15] present an algorithm for simultaneous scheduling of workstations and AGVs in FMS using nonlinear mixed integer programming.…”
Section: Literature Reviewmentioning
confidence: 99%
See 2 more Smart Citations
“…Simultaneously, scheduling of machines and AGV is the only means of ensuring the validity of all the individual schedules [2]. Algorithms in the literature that simultaneously schedule jobs and AGVs alone while ignoring AGVs routing and dispatching includes single objective approach [13][14][15][16][17][18] and multiple objective approach [19,20]. Bilge and Ulusoy [15] present an algorithm for simultaneous scheduling of workstations and AGVs in FMS using nonlinear mixed integer programming.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Gnanavel Babu et al [16] presents differential evolution-based approach to FMS and AGV simultaneous scheduling. Zheng et al [17] presents constraint programming-based approach to AGVs and jobs simultaneous scheduling.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Simulated Annealing [230], Tabu Search [231], Greedy Algorithm [232], GRASP [233], Variable Neighborhood Search [234], Hill Climbing [235], and Iterated Local Search [158] are single-solutionbased metaheuristics. As shown in Table 2, Simulated Annealing and Tabu Search are the two most popular singlesolution-based metaheuristics for both scheduling and VRP.…”
Section: Single-solution-based Metaheuristicsmentioning
confidence: 99%
“…Many models and methods aimed at cyclic scheduling of concurrently flowing jobs have been considered to date. Among those, the mathematical programming approach (Von Kampmeyer 2006), max-plus algebra (Polak et al 2004), Petri nets (Baruwa and Piera 2016), tabu search (Zheng et al 2014) constraint logic programming (Bocewicz et al 2014a, b) frameworks are the more frequently used. Most of these methods aim at finding a minimal cycle or maximal throughput while assuming deadlock-free processes flow.…”
Section: Introductionmentioning
confidence: 99%