2004
DOI: 10.1016/s0377-2217(02)00644-6
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid flow-shop scheduling problems with multiprocessor task systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
61
0
1

Year Published

2008
2008
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 92 publications
(62 citation statements)
references
References 22 publications
0
61
0
1
Order By: Relevance
“…In [38] and [37] a similar TS was also developed and used to solve real instances of a container handling system. The multiprocessor task problem with precedence relationships is approached by [142]. A TS metaheuristic is proposed, some special cases of the problem are proved to be polynomially solvable, whereas others are proved to be N P-hard.…”
Section: Metaheuristicsmentioning
confidence: 99%
See 2 more Smart Citations
“…In [38] and [37] a similar TS was also developed and used to solve real instances of a container handling system. The multiprocessor task problem with precedence relationships is approached by [142]. A TS metaheuristic is proposed, some special cases of the problem are proved to be polynomially solvable, whereas others are proved to be N P-hard.…”
Section: Metaheuristicsmentioning
confidence: 99%
“…In [139], a multi-processor problem was considered. A GA, similar to the one presented in [220], was compared with the sophisticated TS of [142] and obtained better results. A realistic problem from a check-processing company that considered recirculation and the sum of weighted tardiness objective was approached using GA by [20].…”
Section: Metaheuristicsmentioning
confidence: 99%
See 1 more Smart Citation
“…Manufacturing systems considered in studies by Oğuzc et al (2004), Oğuzc & Frinket (2005) and Ying & Lin (2006) are referred as flow shop with multiprocessors (FSMP). It is a special case of HFS where the parallel machines are assumed to be identical.…”
Section: Hfs Lot Streaming Problem State Of Artmentioning
confidence: 99%
“…al., 2003) researchers targeted two layer flow-shops with multiprocessors. Simple list based heuristics as well as meta-heuristics were introduced for the solution www.intechopen.com Particle Swarm Optimization 156 (Oğuz et al,2003, Jdrzęjowicz & Jdrzęjowicz,2003, Oğuz et al,2004. Apparently, a broader form of the problem will have arbitrary number of stages in the flow-shop environment.…”
Section: Introductionmentioning
confidence: 99%