Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness

Liao, Li-Man; Huang, Ching‐Jen

doi:10.1016/j.amc.2010.05.089

Cited by 22 publications

(10 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In all of the research performed in permutation and non-permutation flowshops, researchers developed a heuristic algorithm to solve the problem (Aggoune & Portmann, 2006;Chang, Chen, & Liu, 2007;Kuo et al, 2009;Liao & Huang, 2010;Mehravaran & Logendran, 2012;Ruiz & Maroto, 2005;Srikar & Ghosh, 1986;Yagmahan & Yenisey, 2010;Ying, 2008) but only some of them, including us, developed a mathematical model (Kuo et al, 2009;Liao & Huang, 2010;Mehravaran & Logendran, 2012;Srikar & Ghosh, 1986), to optimize the objective function and provide an assessment for the quality of their heuristics. However, they did not consider dual resources either in permutation or non-permutation flowshop.…”

Section: Introductionmentioning

confidence: 99%

Non-permutation flowshop scheduling with dual resources

Mehravaran

Logendran

2013

Expert Systems with Applications

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Non-permutation flowshop scheduling with dual resources

Mehravaran

Logendran

2013

Expert Systems with Applications

View full text Add to dashboard Cite

“…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. Our proposed equation consumes much time to rank alternatives.…”

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

“…Grabowski and Pempera (2007) used TS algorithm to develop a method for minimizing makespan in a flowshop problem. Liao and Huang (2010) proposed a method to solve a sequencing problem that simultaneously uses two TS algorithms with adaptation of permutation method. Tasgetiren et al (2007) presented PSO to solve the permutation flowshop sequencing problem with the objectives of minimizing makespan and the total flowtime of jobs.…”

Section: Meta-heuristic Procedures For Apmmentioning

confidence: 99%

Adjusted permutation method for multiple attribute decision making with meta-heuristic solution approaches

Rezaeinia¹,

Karimi²

2011

IJIEC

View full text Add to dashboard Cite

The permutation method of multiple attribute decision making has two significant deficiencies: high computational time and wrong priority output in some problem instances. In this paper, a novel permutation method called adjusted permutation method (APM) is proposed to compensate deficiencies of conventional permutation method. We propose Tabu search (TS) and particle swarm optimization (PSO) to find suitable solutions at a reasonable computational time for large problem instances. The proposed method is examined using some numerical examples to evaluate the performance of the proposed method. The preliminary results show that both approaches provide competent solutions in relatively reasonable amounts of time while TS performs better to solve APM.

show abstract

Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness

Cited by 22 publications

References 24 publications

Non-permutation flowshop scheduling with dual resources

Non-permutation flowshop scheduling with dual resources

Permutation based decision making under fuzzy environment using Tabu search

Adjusted permutation method for multiple attribute decision making with meta-heuristic solution approaches

Contact Info

Product

Resources

About