A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion

Taşgetiren, M. Fatih; Pan, Quan-Ke; Suganthan, Ponnuthurai Nagaratnam; Öner, Adalet

doi:10.1016/j.apm.2013.02.011

Cited by 89 publications

(24 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Several case studies can be easily conducted utilizing the said algorithm. The due date of the i-th job is [36], where λ represents the tightness factor, T i,j is the processing time of i-th job processed on the j-th machine, and m is the total machine number. The tightness factor λ is set as 1, 2, and 3 to demonstrate the due date loose, medium, and tight, respectively.…”

Section: Results and Analysismentioning

confidence: 99%

Hybrid Algorithm Based on an Estimation of Distribution Algorithm and Cuckoo Search for the No Idle Permutation Flow Shop Scheduling Problem with the Total Tardiness Criterion Minimization

Sun¹,

Gu²

2017

Sustainability

View full text Add to dashboard Cite

Abstract:The no idle permutation flow shop scheduling problem (NIPFSP) is a popular NP-hard combinatorial optimization problem, which exists in several real world production processes. This study proposes a novel hybrid estimation of the distribution algorithm and cuckoo search (CS) algorithm (HEDA_CS) to solve the NIPFSP with the total tardiness criterion minimization. The problem model is built on the basis of the starting and ending time point of each job. A discrete solution representation method is applied in HEDA_CS to increase the operation efficiency. A novel probability matrix build method is also designed within the knowledge of the processing time matrix. The partially-mapped crossover operation works effectively during the CS phase. A suitable knowledge-based local search is also designed in the HEDA_CS to balance the exploitation and exploration. Finally, many simulations based on the new hard Ruiz benchmarks are conducted. Computational results demonstrate the effectiveness of the proposed HEDA_CS.

show abstract

Section: Results and Analysismentioning

confidence: 99%

Hybrid Algorithm Based on an Estimation of Distribution Algorithm and Cuckoo Search for the No Idle Permutation Flow Shop Scheduling Problem with the Total Tardiness Criterion Minimization

Sun¹,

Gu²

2017

Sustainability

View full text Add to dashboard Cite

show abstract

“…De acordo com os autores, é um dos mais importantes problemas de planejamento da produção. Pode ser encontrado em ambientes industriais de produção intermitente, como: indústrias químicas, eletrônicas, fundições, processamento de fibra de vidro dentre outras (Kim, 1995;Tasgetiren et al, 2013).…”

Section: Introductionunclassified

Programação Da Produção Em Flow Shop Permutacional Envolvendo Medidas De Atraso: Uma Contribuição Bibliométrica a Partir Da Base De Dados Web of Science

Hordones

Fuchigami

2017

HOLOS

View full text Add to dashboard Cite

A organização de dados sobre a produção científica de um período contribui para a continuidade da pesquisa e para o desenvolvimento de um campo particular do conhecimento. O principal objetivo desta pesquisa é conhecer o panorama da produção científica sobre programação da produção em sistemas flow fhop permutacional envolvendo medidas de atraso, de maneira quantitativa, identificando os periódicos de destaque, autores que mais abordaram o tema e os trabalhos mais representativos. Tratou--se de um estudo de análise bibliométrica, através da base de dados Web of Science e seu tratamento pelos softwares ResearcherID® e VosViewer®. Para a pesquisa, utilizou--se os seguintes expressões--chave: "permu * flow * e tard *" ou "permu * flow* e atras*", gerando uma amostra constituída por 133 artigos. Ao final do estudo, apresentou--se resultados de estatística descritiva com várias identificações, como os principais autores e os artigos e periódicos mais referenciados por estudiosos em todo o mundo. Além das principais redes sociais: de citações e cocitações. Tem--se neste trabalho, portanto, um importante aliado no desenvolvimento de novas abordagens sobre o tema. PALAVRAS--CHAVE:programação da produção, sequenciamento da produção, análise de redes, análise bibliométrica.

show abstract

“…The RIS local search is an insertion local search neighborhood. The details can be found in [47,[54][55][56][57][58][59]. Note that the fast fitness calculation is used in the RIS local search.…”

Section: Variable Local Searchmentioning

confidence: 99%

A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion

et al. 2016

Self Cite

View full text Add to dashboard Cite

Abstract:In this paper, we present a variable block insertion heuristic (VBIH) algorithm to solve the blocking flowshop scheduling problem with the total flowtime criterion. In the VBIH algorithm, we define a minimum and a maximum block size. After constructing the initial sequence, the VBIH algorithm starts with a minimum block size being equal to one. It removes the block from the current sequence and inserts it into the partial sequence sequentially with a predetermined move size. The sequence, which is obtained after several block moves, goes under a variable local search (VLS), which is based on traditional insertion and swap neighborhood structures. If the new sequence obtained after the VLS local search is better than the current sequence, it replaces the current sequence. As long as it improves, it keeps the same block size. However, if it does not improve, the block size is incremented by one and a simulated annealing-type of acceptance criterion is used to accept the current sequence. This process is repeated until the block size reaches at the maximum block size. Furthermore, we present a novel constructive heuristic, which is based on the profile fitting heuristic from the literature. The proposed constructive heuristic is able to further improve the best known solutions for some larger instances in a few seconds. Parameters of the constructive heuristic and the VBIH algorithm are determined through a design of experiment approach. Extensive computational results on the Taillard's well-known benchmark suite show that the proposed VBIH algorithm outperforms the discrete artificial bee colony algorithm, which is one of the most efficient algorithms recently in the literature. Ultimately, 52 out of the 150 best known solutions are further improved with substantial margins.

show abstract

A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion

Cited by 89 publications

References 30 publications

Hybrid Algorithm Based on an Estimation of Distribution Algorithm and Cuckoo Search for the No Idle Permutation Flow Shop Scheduling Problem with the Total Tardiness Criterion Minimization

Hybrid Algorithm Based on an Estimation of Distribution Algorithm and Cuckoo Search for the No Idle Permutation Flow Shop Scheduling Problem with the Total Tardiness Criterion Minimization

Programação Da Produção Em Flow Shop Permutacional Envolvendo Medidas De Atraso: Uma Contribuição Bibliométrica a Partir Da Base De Dados Web of Science

A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion

Contact Info

Product

Resources

About