2014
DOI: 10.1007/978-3-319-12970-9_2
|View full text |Cite
|
Sign up to set email alerts
|

Metaheuristics for Solving a Hybrid Flexible Flowshop Problem with Sequence-Dependent Setup Times

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…Due to the fact that published examples consist of only processing times we needed to complete those examples by generating weights (w i ) and due dates (d i ). We applied the following schema: w i has been generated uniformly from the range [1,10] and d i has been generated uniformly from the range [P (1 − T − R/2), P (1 − T + R/2)] where P denotes the best known value for the makespan for the C max problem, T = 0.3 and R = 0.3 ( [11]).…”
Section: Test Datamentioning
confidence: 99%
“…Due to the fact that published examples consist of only processing times we needed to complete those examples by generating weights (w i ) and due dates (d i ). We applied the following schema: w i has been generated uniformly from the range [1,10] and d i has been generated uniformly from the range [P (1 − T − R/2), P (1 − T + R/2)] where P denotes the best known value for the makespan for the C max problem, T = 0.3 and R = 0.3 ( [11]).…”
Section: Test Datamentioning
confidence: 99%