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

Oğuzhan Ahmet ARIK

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, wellknown met ...Daha fazlası

Makale/Derleme 2021 SOFT COMPUTING 10 Görüntülenme

Erişime Açık

Artificial Bee Colony Algorithm Including Some Components Of Iterated Greedy Algorithm For Permutation Flow Shop Scheduling Problems

Oğuzhan Ahmet ARIK

The permutation flow shop scheduling problem has been investigated by researchers for more than 40 years due to its complexity and lots of real-life examples of the problem. Many exact or approximate solution approaches have been presented for the problem. Among solution approaches in the literature, iterated greedy algorithm and its variants are the most effective solution methods for the problem. This paper proposes a hybrid solution algorithm that uses the best components such as local search operators and destruction/construction operators of the variants of iterated greedy algorithm in an ...Daha fazlası

Makale/Derleme 2021 Neural Computing and Applications 11 Görüntülenme