2013
DOI: 10.1007/978-3-319-00930-8_11
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective Algorithms for the Single Machine Scheduling Problem with Sequence-dependent Family Setups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…Rego et al. () applied MO‐VNS for solving a biobjective single machine scheduling problem in which the setup time depends on the sequence and job family. Gomes et al.…”
Section: Introductionmentioning
confidence: 99%
“…Rego et al. () applied MO‐VNS for solving a biobjective single machine scheduling problem in which the setup time depends on the sequence and job family. Gomes et al.…”
Section: Introductionmentioning
confidence: 99%