2012
DOI: 10.1007/s00170-012-4216-y
|View full text |Cite
|
Sign up to set email alerts
|

Two meta-heuristics for solving a new two-machine flowshop scheduling problem with the learning effect and dynamic arrivals

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(3 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…Heizer and Render [34] showed that the learning rate could range between 0.7 and 0.9 for di erent industries. Also, several studies, such as [35,36], considered the learning rate to be at the interval of [0:7 0:9]. In this paper, this rate is assumed to be 0.85.…”
Section: Computational Resultsmentioning
confidence: 99%
“…Heizer and Render [34] showed that the learning rate could range between 0.7 and 0.9 for di erent industries. Also, several studies, such as [35,36], considered the learning rate to be at the interval of [0:7 0:9]. In this paper, this rate is assumed to be 0.85.…”
Section: Computational Resultsmentioning
confidence: 99%
“…Learning effects in scheduling are very popular, and researchers have modeled various kinds of scheduling problems with learning effects (e.g. see Biskup 1999Biskup , 2008Hosseini & Tavakkoli-Moghaddam, 2012;Mosheiov, 2001, Qian & Steiner, 2013. The first attempt to consider the learning effect in scheduling problems was by Biskup (1999) who proposed a kind of the learning effect in a single machine scheduling problem.…”
Section: Learning Effectmentioning
confidence: 99%
“…Heuristic Hosseini and Tavakkoli-Moghaddam (2013) show an interesting variant of the twomachine problem with learning effects. They assume dynamic arrivals of jobs within a pre-specified time window.…”
Section: The Flow-shop Environmentmentioning
confidence: 99%