A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

Bülbül, Kerem

doi:10.1016/j.cor.2010.09.015

Cited by 45 publications

(18 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Table 3 shows the results from GTN together with the results of GLS reported in Essafi et al (2008) and the results of SB-TS reported in Bülbül (2011). GLS was run for 200 generations disregarding the size of the instances, but the authors do not give further details about the time taken in their experiments, so the comparison may not be entirely accurate.…”

Section: Results From Jsp Instances Without Setup Timesmentioning

confidence: 98%

“…We start considering the benchmark proposed by Singer and Pinedo to compare GTN with the hybrid genetic algorithm (GLS) proposed in Essafi et al (2008), the general local search method (MDL) proposed in Mati et al (2011), and the hybrid shifting bottleneck-tabu search (SB-TS) proposed in Bülbül (2011). GLS is implemented in C++ and was run in a PC with a 2.8 GHz processor and 512 MB RAM and MDL was run in a Pentium with a 2.6 GHz processor, in both cases giving maximum runtime of 18 seconds per run.…”

Section: Results From Jsp Instances Without Setup Timesmentioning

confidence: 99%

“…As source of BKS, we shall use the best values reported so far in the literature together with the values obtained in our experiments, as these often yields better solutions than those from the literature. For all methods, we have used the same BKS to calculate gaps, so we report some values that differ from those given in Bülbül (2011), where the authors use the solutions reported in Singer and Pinedo (1998) to calculate the gaps.…”

Section: Performance Metricsmentioning

confidence: 99%

“…GAP", is computed as the error in percent averaged for all instances. As it is done in Bülbül (2011), an instance with zero optimal value has to be excluded from the computation of the average gap.…”

Section: Performance Metricsmentioning

confidence: 99%

“…The resulting algorithm compares favorably to the approaches given in Singer and Pinedo (1998), Kreipl (2000) and Van Hentenryck and Michel (2004), where a local search using constraint programming is proposed. Recently, a hybrid shifting bottleneck-tabu search heuristic (SB-TS) is proposed in Bülbül (2011) which replaces the re-optimization step in the shifting bottleneck algorithm by TS. The authors report results across conventional instances showing that SB-TS obtains similar results to other methods.…”

Section: Job Shop Problem and Total Weighted Tardinessmentioning

confidence: 99%

See 4 more Smart Citations

An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization

et al. 2012

View full text Add to dashboard Cite

We confront the job shop scheduling problem with sequence dependent setup times and weighted tardiness minimization. To solve this problem, we propose a hybrid metaheuristic that combines the intensification capability of tabu search with the diversification capability of a genetic algorithm which plays the role of long term memory for tabu search in the combined approach. We define and analyze a new neighborhood structure for this problem which is embedded in the tabu search algorithm. The efficiency of the proposed algorithm relies on some elements such as neighbors filtering and a proper balance between intensification and diversification of the search. We report results from an experimental study across conventional benchmarks, where we analyze our approach and demonstrate that it compares favorably to the state-of-the-art methods.

show abstract

Section: Results From Jsp Instances Without Setup Timesmentioning

confidence: 98%

Section: Results From Jsp Instances Without Setup Timesmentioning

confidence: 99%

Section: Performance Metricsmentioning

confidence: 99%

Section: Performance Metricsmentioning

confidence: 99%

Section: Job Shop Problem and Total Weighted Tardinessmentioning

confidence: 99%

See 3 more Smart Citations

An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization

et al. 2012

View full text Add to dashboard Cite

show abstract

Two Step Algorithm for Virtual Machine Distributed Replication with Limited Bandwidth Problem

Bożejko

Nadybski

Wodecki

2016

Computer Information Systems and Industrial Management

View full text Add to dashboard Cite

Part 5: Scheduling in Manufacturing and Other ApplicationsInternational audienceThis article presents a proposal of solution for the problem of optimization of the virtual machine (VM) backup or replication process in architecture with multiple locations where efficient bandwidth usage and maximal tardiness for single VM are objectives. The two step algorithm is considered, where in the first step a set of tasks is partitioned into smaller subsets for load balancing. In the second step - tabu search algorithm is used to minimize weighted sum of tardiness. The paper contains the results of computational experiments on the scalability of the presented method

show abstract

Solving an Integration Process Planning and Scheduling in a Flexible Job Shop Using a Hybrid Approach

Keddari

Mebarki

Shahzad

et al. 2018

Computational Intelligence and Its Applications

View full text Add to dashboard Cite

Traditionally, process planning and scheduling functions are performed sequentially, where scheduling is implemented after process plans has been generated. Recent research works have shown that the integration of these two manufacturing system functions can significantly improve scheduling objectives. In this paper, we present a new hybrid method that integrates the two functions in order to minimize the makespan. This method is made up of a Shifting Bottleneck Heuristic as a starting solution, Tabu Search (TS) and the Kangaroo Algorithm metaheuristics as a global search. The performance of this newly hybrid method has been evaluated and compared with an integrated approach based on a Genetic Algorithm. Thereby, the characteristics and merits of the proposed method are highlighted.

show abstract

A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

Cited by 45 publications

References 23 publications

An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization

An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization

Two Step Algorithm for Virtual Machine Distributed Replication with Limited Bandwidth Problem

Solving an Integration Process Planning and Scheduling in a Flexible Job Shop Using a Hybrid Approach

Contact Info

Product

Resources

About