2020
DOI: 10.1504/ijise.2020.105732
|View full text |Cite
|
Sign up to set email alerts
|

Simulated annealing approach to minimise total weighted tardiness of non-identical parallel batch processing machines

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…Hulett et al [40] adopted a PSO to minimize the total weighted tardiness. Kakkunuri et al [11] adopted a SA to minimize the total weighted tardiness. Zhou et al [41] and Xu [42] adopted an improved genetic algorithm (GA) to minimize the makespan, respectively.…”
Section: Bpm Scheduling Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…Hulett et al [40] adopted a PSO to minimize the total weighted tardiness. Kakkunuri et al [11] adopted a SA to minimize the total weighted tardiness. Zhou et al [41] and Xu [42] adopted an improved genetic algorithm (GA) to minimize the makespan, respectively.…”
Section: Bpm Scheduling Problemmentioning
confidence: 99%
“…ere have been some studies on this issue, such as Li [10] and Jia et al [1] who addressed this problem to minimize the makespan. Kakkunuri et al [11] addressed this problem to minimize the total weighted tardiness. Generally speaking, the research on this problem is still less.…”
Section: Introductionmentioning
confidence: 99%