New block properties for the permutation flow shop problem with application in tabu search

Grabowski, J.; Pempera, Jarosław

doi:10.1057/palgrave.jors.2601055

Cited by 65 publications

(20 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

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

“…Discovered by Grabowski et al block properties have been successfully used not only in the construction of exact algorithms for flow shop and job shop problems (the exact solution of small size), but also in the construction of one of the most effective heuristic algorithms for the following problems: flow shop [3,7], job shop [8], no-store (blocking) flow shop [9] etc.…”

Section: Introductionmentioning

confidence: 99%

An exact block algorithm for no-idle RPQ problem

Pempera

2017

Archives of Control Sciences

View full text Add to dashboard Cite

In the work a single-machine scheduling problem is being considered, in which all tasks have a fixed availability (release) and delivery time. In the analyzed variant no-idle time is allowed on a machine. The purpose of optimization is to determine such order of tasks that minimizes the makespan, i.e. the time of execution of all the tasks. There is also a number of properties of the problem presented, in particular there are formulated block eliminating properties for no-idle constraint. There was an exact B&B algorithm based on the block properties proposed.

show abstract

“…As the PFSP is a well-known NP-hard problem (Rinnooy Kan in 1976 proved 16 that the makespan minimization problem is NP-complete and the flowtime minimization one was proved 17 by Garey et al in 1976), metaheuristics like tabu search (e.g., see Refs. [18][19][20][21][22][23][24], genetic algorithms (e.g., see Refs. [25][26][27][28][29][30][31], simulated annealing (e.g., see Refs.…”

Section: Introductionmentioning

confidence: 99%

A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem

Ahmadizar¹,

Barzinpour²

2010

IJCIS

View full text Add to dashboard Cite

This paper deals with the permutation flow shop scheduling problem. The objective is to minimize the maximum completion time, or makespan. To solve this problem which has been proved to be strongly NP-hard, a combination between an ant colony algorithm, a heuristic algorithm and a local search procedure is proposed and presented. The hybrid approach is to use artificial ants to construct solutions by applying a stochastic greedy rule based on the Gupta's heuristic and pheromone trails. A local search is then performed to improve the performance quality of constructed solutions. Once all ants have terminated their generations, the pheromone trails are modified according to a global updating rule. The proposed algorithm is applied to benchmark problems taken from the literature and compared with other metaheuristics. Computational experiments are given to demonstrate the superiority of the algorithm in the quality of solution and CPU time.

show abstract

New block properties for the permutation flow shop problem with application in tabu search

Cited by 65 publications

References 17 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

An exact block algorithm for no-idle RPQ problem

A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem

Contact Info

Product

Resources

About