The permutation flow shop problem with blocking. A tabu search approach

Grabowski, J.; Pempera, Jarosław

doi:10.1016/j.omega.2005.07.004

Cited by 139 publications

(72 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The permutation π = (5, 2, 3, 1, 6, 4) and its critical path u * = (2, 5, 5) which generate three blocks: B 1 = (5, 2), B 2 = (2, 3, 1, 6) and B 3 = (6, 4), and three relevant internal blocks B * 2) Block Properties: Block properties (BPs) are some general properties associated with the graph representation of scheduling problems with the makespane criterion [12]. This section introduce two BPs proposed by Nowicki [11] and Grabowski [13] [14] that are associated with the neighbourhood structure.…”

Section: And Is Made Of Verticesmentioning

confidence: 99%

MOEA/D with Tabu Search for multiobjective permutation flow shop scheduling problems

Alhindi

Zhang

2014

2014 IEEE Congress on Evolutionary Computation (CEC)

View full text Add to dashboard Cite

Abstract-Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D) decomposes a multiobjective optimisation problem into a number of single-objective problems and optimises them in a collaborative manner. This paper investigates how to use Tabu Search (TS), a well-studied single objective heuristic to enhance MOEA/D performance. In our proposed approach, the TS is applied to these subproblems with the aim to escape from local optimal solutions. The experimental studies have shown that MOEA/D with TS outperforms the classical MOEA/D on multiobjective permutation flow shop scheduling problems. It also have demonstrated that use of problem specific knowledge can significantly improve the algorithm performance.

show abstract

Section: And Is Made Of Verticesmentioning

confidence: 99%

MOEA/D with Tabu Search for multiobjective permutation flow shop scheduling problems

Alhindi

Zhang

2014

2014 IEEE Congress on Evolutionary Computation (CEC)

View full text Add to dashboard Cite

show abstract

“…The second variant of DE is the discrete DE (DDE) and the hybrid discrete DE (HDDE) of Ling et al (2010). The third algorithm is the GA of Caraffa et al (2001), and finally the TS and its multimoves (TS+M) variant of Grabowski and Pempera (2007).…”

Section: Termination and Starting Criteriamentioning

confidence: 99%

“…Comparison of DSOMA C with TS and TS+M Table 6 compares the results of DSOMA C with the TS and its hybrid variant TS+M algorithms of Grabowski and Pempera (2007). TS is considered one of the best constructive heuristics, and it has successfully been applied to a number of complex optimisation tasks (Grabowski and Pempera, 2007).…”

Section: Termination and Starting Criteriamentioning

confidence: 99%

Scheduling The Flow Shop With Blocking Problem With The Chaos-Induced Discrete Self Organising Migrating Algorithm

Davendra¹,

Bialic-Davendra²,

Šenkeřík³

et al. 2013

ECMS 2013 Proceedings Edited By: Webjorn Rekdalsbakken, Robin T. Bye, Houxiang Zhang

View full text Add to dashboard Cite

“…Nowicki & Smutnicki, 1996;Grabowski & Wodecki, 2004). Grabowski and Pempera (2007) used this method for minimizing make span in a flow shop problem. Liao and Huang (2010) proposed a method for solving a sequencing problem, which uses two TS algorithms simultaneously to solve a kind of sequencing problem by applying permutation method.…”

Section: Ts Solution Algorithmmentioning

confidence: 99%

Permutation based decision making under fuzzy environment using Tabu search

Bashiri¹,

Koosha²,

Karimi³

2012

ijiec

View full text Add to dashboard Cite

One of the techniques, which are used for Multiple Criteria Decision Making (MCDM) is the permutation. In the classical form of permutation, it is assumed that weights and decision matrix components are crisp. However, when group decision making is under consideration and decision makers could not agree on a crisp value for weights and decision matrix components, fuzzy numbers should be used. In this article, the fuzzy permutation technique for MCDM problems has been explained. The main deficiency of permutation is its big computational time, so a Tabu Search (TS) based algorithm has been proposed to reduce the computational time. A numerical example has illustrated the proposed approach clearly. Then, some benchmark instances extracted from literature are solved by proposed TS. The analyses of the results show the proper performance of the proposed method.

show abstract

The permutation flow shop problem with blocking. A tabu search approach

Cited by 139 publications

References 19 publications

MOEA/D with Tabu Search for multiobjective permutation flow shop scheduling problems

MOEA/D with Tabu Search for multiobjective permutation flow shop scheduling problems

Scheduling The Flow Shop With Blocking Problem With The Chaos-Induced Discrete Self Organising Migrating Algorithm

Permutation based decision making under fuzzy environment using Tabu search

Contact Info

Product

Resources

About