Population-based Tabu search with evolutionary strategies for permutation flow shop scheduling problems under effects of position-dependent learning and linear deterioration

30Citations
Citations of this article
57Readers
Mendeley users who have this article in their library.

Abstract

This paper investigates permutation flow shop scheduling (PFSS) problems under the effects of position-dependent learning and linear deterioration. In a PFSS problem, there are n jobs and m machines in series. Jobs are separated into operations on m different machines in series, and jobs have to follow the same machine order with the same sequence. The PFSS problem under the effects of learning and deterioration is introduced with a mixed-integer nonlinear programming model. The time requirement for solving large-scale problems type of PFSS problem is exceedingly high. Therefore, well-known metaheuristic methods for the PFSS problem without learning and deterioration effects such as iterated greedy algorithms and discrete differential evolution algorithm are adapted for the problem with learning and deterioration effects in order to find a faster and near-optimal or optimal solution for the problem. Furthermore, this paper proposes a hybrid solution algorithm that is called population-based Tabu search algorithm (TSPOP) with evolutionary strategies such as crossover and mutation. The search algorithm is built on the basic structure of Tabu search and it searches for the best candidate from a solution population instead of improving the current best candidate at each iteration. Furthermore, the performances of these methods in view of solution quality are discussed in this paper by using test problems for 20, 50, and 100 jobs with 5, 10, 20 machines. Experimental results show that the proposed TSPOP algorithm outperforms the other existing algorithms in view of solution quality.

References Powered by Scopus

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

4834Citations
N/AReaders
Get full text

Benchmarks for basic scheduling problems

2094Citations
N/AReaders
Get full text

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

976Citations
N/AReaders
Get full text

Cited by Powered by Scopus

An effective hybrid collaborative algorithm for energy-efficient distributed permutation flow-shop inverse scheduling

109Citations
N/AReaders
Get full text

An effective hybrid meta-heuristic for flexible flow shop scheduling with limited buffers and step-deteriorating jobs

27Citations
N/AReaders
Get full text

An Improved Evolution Strategy Hybridization with Simulated Annealing for Permutation Flow Shop Scheduling Problems

24Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Arık, O. A. (2021). Population-based Tabu search with evolutionary strategies for permutation flow shop scheduling problems under effects of position-dependent learning and linear deterioration. Soft Computing, 25(2), 1501–1518. https://doi.org/10.1007/s00500-020-05234-7

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 6

60%

Lecturer / Post doc 2

20%

Professor / Associate Prof. 1

10%

Researcher 1

10%

Readers' Discipline

Tooltip

Engineering 9

69%

Computer Science 2

15%

Decision Sciences 1

8%

Environmental Science 1

8%

Save time finding and organizing research with Mendeley

Sign up for free