2009
DOI: 10.1016/j.cie.2009.05.002
|View full text |Cite
|
Sign up to set email alerts
|

Two-machine flow shop problem with effects of deterioration and learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 39 publications
(12 citation statements)
references
References 39 publications
0
12
0
Order By: Relevance
“…It follows from the observations that algorithms constructed on the basis of the classical models usually provide unsatisfactory (unstable) solutions for real-life flowshop problems, since these models do not take into consideration additional factors that are significant in practice, e.g. sequence-dependent setup times [16,20] or variable processing times [2,4,5,23,27,31]. To this group belong the described real-life problems, where a deterioration of machines (understood as chemical cleaning baths, lathe machines, human workers etc.)…”
mentioning
confidence: 99%
“…It follows from the observations that algorithms constructed on the basis of the classical models usually provide unsatisfactory (unstable) solutions for real-life flowshop problems, since these models do not take into consideration additional factors that are significant in practice, e.g. sequence-dependent setup times [16,20] or variable processing times [2,4,5,23,27,31]. To this group belong the described real-life problems, where a deterioration of machines (understood as chemical cleaning baths, lathe machines, human workers etc.)…”
mentioning
confidence: 99%
“…Lee and Wu (2004) considered learning effect in a two-machine scheduling problem that's objective is to minimise the total completion time. Wang and Liu (2009) investigated a two-machine flow shop scheduling problem under effect of learning and deterioration in order to minimise total completion time by using a branch and bound algorithm. Wang, Ji, Cheng and Wang (2012) investigated a two-machine flow shop scheduling problem under learning and deterioration effects for minimisation of makespan by using heuristic algorithms and a branch and bound algorithm.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Finally, the problems, in which ageing index depended on jobs and on processors, are analyzed (Wang and Liu, 2009), i.e. the processing time is expressed as:…”
Section: Time and Position Dependent Modelsmentioning
confidence: 99%