2020
DOI: 10.1016/j.cie.2020.106799
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic integrated process planning, scheduling and due-date assignment using ant colony optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 31 publications
(20 citation statements)
references
References 67 publications
0
17
0
Order By: Relevance
“…In this context, heuristic procedures, nature-inspired methods, neural networks, and utilizing priority dispatching rules are the most applied methods to solve the optimization problem in scheduling [1]. The most common metaheuristic procedures, such as Simulating Annealing [6], Tabu search [12], Random Search, or many types of nature-inspired optimization methods, such as evolutionary [7,28,29] and genetic algorithms [18], ant colony optimization [30], or particle swarm optimization [16,19,31], can provide acceptable solutions near the optimum. Although metaheuristics are advantageous in the sense of the solution quality and robustness, they do not guarantee solution optimality [1,27], they depend on the choice of method's parameters [11], and they are often too complex to implement computationally in a real-time system [2].…”
Section: Scheduling In the Flexible Job Shop Systemsmentioning
confidence: 99%
See 2 more Smart Citations
“…In this context, heuristic procedures, nature-inspired methods, neural networks, and utilizing priority dispatching rules are the most applied methods to solve the optimization problem in scheduling [1]. The most common metaheuristic procedures, such as Simulating Annealing [6], Tabu search [12], Random Search, or many types of nature-inspired optimization methods, such as evolutionary [7,28,29] and genetic algorithms [18], ant colony optimization [30], or particle swarm optimization [16,19,31], can provide acceptable solutions near the optimum. Although metaheuristics are advantageous in the sense of the solution quality and robustness, they do not guarantee solution optimality [1,27], they depend on the choice of method's parameters [11], and they are often too complex to implement computationally in a real-time system [2].…”
Section: Scheduling In the Flexible Job Shop Systemsmentioning
confidence: 99%
“…Although metaheuristics are advantageous in the sense of the solution quality and robustness, they do not guarantee solution optimality [1,27], they depend on the choice of method's parameters [11], and they are often too complex to implement computationally in a real-time system [2]. To enhance the efficiency of metaheuristic, a hybrid approach based on combining different methods has been often proposed by several authors in their works [9,19,32,33].…”
Section: Scheduling In the Flexible Job Shop Systemsmentioning
confidence: 99%
See 1 more Smart Citation
“…For the IPPSDDA problem it is better to see Demir and Taskin (2005) and Ceven and Demir (2007). Demir and Taskin (2005) worked on IPPSDDA problem in a Ph.D. Thesis. Later Ceven and Demir (2007) worked on benefit of integrating due date assignment with IPPS problem in an M.S.…”
Section: Background and Literature Surveymentioning
confidence: 99%
“…In the literature, there is not much work done on IPPSDDA (integrated process planning, scheduling and due date assignment). (Demir, H.I. and Taskin, H., 2005) studied IPPSDDA problem in a PhD thesis.…”
Section: Background and Literature Surveymentioning
confidence: 99%