2019 International Conference on Industrial Engineering and Systems Management (IESM) 2019
DOI: 10.1109/iesm45758.2019.8948147
|View full text |Cite
|
Sign up to set email alerts
|

Constructive heuristics for the minimization of core waiting time in permutation flow shop problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 25 publications
0
2
0
Order By: Relevance
“…Jobs are sorted according to a specific rule depending on which OF is minimized. For makespan and total completion time minimization (NEHCmax, NEHCtot), jobs are sorted according to the decreasing sum of processing times; for waiting time minimization (NEHCwt), jobs are sorted according to the index defined by [17] (that accounts for the variability of processing times); for idle time minimization (NEHCit), jobs are sorted according to the descending order of the index defined by [18] (that accounts for the variability, skewness and kurtosis of processing times). 2.…”
Section: Fig 1 Flow Shop Layoutmentioning
confidence: 99%
“…Jobs are sorted according to a specific rule depending on which OF is minimized. For makespan and total completion time minimization (NEHCmax, NEHCtot), jobs are sorted according to the decreasing sum of processing times; for waiting time minimization (NEHCwt), jobs are sorted according to the index defined by [17] (that accounts for the variability of processing times); for idle time minimization (NEHCit), jobs are sorted according to the descending order of the index defined by [18] (that accounts for the variability, skewness and kurtosis of processing times). 2.…”
Section: Fig 1 Flow Shop Layoutmentioning
confidence: 99%
“…For scheduling problems, particle swarm optimization (PSO) algorithms [22,23], as well as genetic algorithms [24], continue to show good results. NEH is also useful for solving flowshop scheduling problems with objective functions different from the makespan, such as minimizing the core waiting time [25], total tardiness [26], total flowtime [27], or makespan [28] for the distributed permutation flowshop problem.…”
Section: Introductionmentioning
confidence: 99%