General flowshop scheduling problem with the sequence dependent setup times: A heuristic approach

Ziaee, Mohsen

doi:10.1016/j.ins.2013.06.025

Search citation statements

Order By: Relevance

Paper Sections

Select...

Npfs Problems2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

2022

Publication Types

Select...

Article4

Book2

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 13 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Vahedi-Nouri et al (2013) solve NPFS problems with learning effects and availability constraints, solving them with a heuristic (VFR) developed by the authors. Ziaee (2013) addresses NPFS with sequence-dependent setup times through a two-phase heuristic. Rossi and Lanzetta (2013) deal with the NPFS problem with an ACO algorithm.…”

Section: Npfs Problemsmentioning

confidence: 99%

“…The vast majority of papers dealing with NPFS problems as their main contribution, present algorithms (meta-heuristics, in general) capable of handling them (Liao et al, 2006;Ying & Lin, 2007;Ying, 2008;Lin & Ying, 2009;Liao & Huang, 2010;Vahedi-Nouri et al, 2013;Ziaee, 2013;Rossi & Lanzetta, 2014;Benavides & Ritt 2016). These algorithms generally address the NPFS problem after a first phase in which it produces a near-optimal PFS solution: different types of procedures are applied to improve this initial PFS solution.…”

Section: Npfs Problemsmentioning

confidence: 99%

See 1 more Smart Citation