An iterated local search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
A Subramanian, M Battarra, CN Potts - International Journal of …, 2014 - Taylor & Francis
The single machine total weighted tardiness problem with sequence-dependent setup times
(often known as problem) requires a given set of jobs to be sequenced on a single machine …
(often known as problem) requires a given set of jobs to be sequenced on a single machine …
A variable iterated greedy algorithm for the traveling salesman problem with time windows
K Karabulut, MF Tasgetiren - Information Sciences, 2014 - Elsevier
This paper presents a variable iterated greedy algorithm for solving the traveling salesman
problem with time windows (TSPTW) to identify a tour minimizing the total travel cost or the …
problem with time windows (TSPTW) to identify a tour minimizing the total travel cost or the …
Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
H Xu, Z Lü, TCE Cheng - Journal of Scheduling, 2014 - Springer
Abstract We present an Iterated Local Search (ILS) algorithm for solving the single-machine
scheduling problem with sequence-dependent setup times to minimize the total weighted …
scheduling problem with sequence-dependent setup times to minimize the total weighted …
An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion
The main contribution of this paper is to present some novel constructive heuristics for the
the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the …
the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the …
A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times
H Xu, Z Lü, A Yin, L Shen, U Buscher - Computers & Operations Research, 2014 - Elsevier
We present a systematic comparison of hybrid evolutionary algorithms (HEAs), which
independently use six combinations of three crossover operators and two population …
independently use six combinations of three crossover operators and two population …
Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of …
In this paper, we consider the single machine scheduling problem with quadratic penalties
and sequence-dependent (QPSD) setup times. QPSD is known to be NP-Hard. Only a few …
and sequence-dependent (QPSD) setup times. QPSD is known to be NP-Hard. Only a few …
An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
G Deng, X Gu - International Journal of Systems Science, 2014 - Taylor & Francis
This article presents an enhanced iterated greedy (EIG) algorithm that searches both insert
and swap neighbourhoods for the single-machine total weighted tardiness problem with …
and swap neighbourhoods for the single-machine total weighted tardiness problem with …
[PDF][PDF] Solving single-machine weighted tardiness and total setup costs scheduling problem with sequence dependant setup times and sequence dependant setup …
NA Al Theeb, T Alhwiti - IIE Annual Conference. Proceedings, 2014 - Citeseer
The single-machine weighted tardiness and total setup costs scheduling problem with
sequence dependent setup times and sequence dependent setup cost (STWTTSCSDSC) …
sequence dependent setup times and sequence dependent setup cost (STWTTSCSDSC) …