Handling ties in heuristics for the permutation flow shop scheduling problem

Vasiljević, Dragan; Danilović, Miloš

doi:10.1016/j.jmsy.2014.11.011

Cited by 36 publications

(10 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, these ties must be broken with a tiebreaking mechanism to increase solution quality. Kalczynski and Kamburowski (2008), Dong et al (2008), Fernandez-Viagas and Framinan (2014), and Vasiljevic and Danilovic (2015) proposed new tiebreaking mechanisms for the problem. Fernandez-Viagas and Framinan (2014) presented a tiebreaking mechanism (TB FF ) for NEH, IG RIS , and IG_RS LS algorithms.…”

Section: Literature Reviewmentioning

confidence: 99%

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

Arık

2020

Soft Comput

View full text Add to dashboard Cite

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 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 (TS POP) 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 TS POP algorithm outperforms the other existing algorithms in view of solution quality.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

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

Arık

2020

Soft Comput

View full text Add to dashboard Cite

show abstract

“…More specifically, improvements in the initial order of the NEH have been proposed by e.g. Framinan, Leisten, and Rajendran (2003) and Vasiljevic and Danilovic (2015) . Regarding improvements in the insertion phase of the NEH, Rad, Ruiz, and Boroojerdian (2009) propose several heuristics (denoted as FRB1, FRB2, FRB3, FRB4_k and FRB5) where a partial insertion local search method after the insertion of a job is employed.…”

Section: Literature Reviewmentioning

confidence: 99%

A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime

Fernández-Viagas

Leisten

2016

Expert Systems with Applications

View full text Add to dashboard Cite

“…The flowshop scheduling problem has been proven to be nondeterministic polynomial-time hard (NP-hard) when the number of machines is larger than 2 [10]. Many studies [5,11] focus on the static environment which simplifies the problem constraint. However, more attention should be paid to dynamic aspects that frequently occurred in reality such as new order arrival [12,13], machine breakdown [14], and rush order [15].…”

Section: Introductionmentioning

confidence: 99%

New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival

Liu

Jin

Price

2018

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Permutation flowshop scheduling problem (PFSP) has attracted lots of attention from both academia and industry as it finds many applications especially for today's mass customization. The PFSP is proved NP-hard, and the dynamic uncertainties such as stochastic new order arrivals significantly increase the problem complexity and difficulty. Many enterprises often struggle to make decisions on accepting new orders and setting due dates for them due to lack of effective scheduling methods. To fill in the knowledge gap, this paper is to propose a new meta-heuristic algorithm which is based on a new enhanced destruction and construction method and a novel repair method while adopting the architecture of the iterated greedy algorithm. Statistical tests were conducted and results show that the new algorithm outperforms existing ones. The maximum completion time of the new order

show abstract

Handling ties in heuristics for the permutation flow shop scheduling problem

Cited by 36 publications

References 29 publications

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

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

A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime

New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival

Contact Info

Product

Resources

About