This paper addresses several issues related to the approximate solution of the Single Machine Scheduling problem with sequence-dependent setup times using metaheuristic methods. Instances with known optimal solution are solved using a memetic algorithm and a multiple start approach. A fitness landscape analysis is also conducted on a subset of instances to understand the behavior of the two approaches during the optimization process. We also present a novel way to create instances with known optimal solutions from the optimally solved asymmetric travelling salesman problem (ATSP) instances. Finally we argue for the test set of instances to be used in future works as a convenient performance benchmark.122165180Boese, K., (1995) Cost versus D...
The paper deals with the single machine scheduling problem where both total and maximum tardiness mu...
The single machine total weighted tardiness problem with sequence dependent setup times is a challen...
Most of the problems defined in the scheduling literature do not yet take into account the energy co...
This work proposes a parallel memetic algorithm applied to the total tardiness single machine schedu...
In this paper, a new memetic algorithm (MA) for the total tardiness single machine scheduling (SMS) ...
This work proposes a parallel memetic algorithm applied to the total tardiness single machine schedu...
Machine scheduling is a central task in production planning. In general it means the problem of sche...
Abstract. In this paper we consider a single machine scheduling prob-lem which is a representative o...
This paper deals with the NP-hard single-machine total weighted tardiness problem with sequence depe...
AbstractThis paper surveys algorithms for the problem of scheduling jobs on a single machine to mini...
In this paper the NP-hard single machine total weighted tardiness scheduling problem in presence of ...
In this paper the NP-hard single machine total weighted tardiness scheduling problem in presence of ...
Tardiness related objectives are of utmost importance in production systems when client satisfaction...
We propose a hybrid algorithm based on the ant colony optimization (ACO) meta-heuristic, in conjunct...
WOS: 000445126100021For the past few years, learning effect has been receiving wide attention in the...
The paper deals with the single machine scheduling problem where both total and maximum tardiness mu...
The single machine total weighted tardiness problem with sequence dependent setup times is a challen...
Most of the problems defined in the scheduling literature do not yet take into account the energy co...
This work proposes a parallel memetic algorithm applied to the total tardiness single machine schedu...
In this paper, a new memetic algorithm (MA) for the total tardiness single machine scheduling (SMS) ...
This work proposes a parallel memetic algorithm applied to the total tardiness single machine schedu...
Machine scheduling is a central task in production planning. In general it means the problem of sche...
Abstract. In this paper we consider a single machine scheduling prob-lem which is a representative o...
This paper deals with the NP-hard single-machine total weighted tardiness problem with sequence depe...
AbstractThis paper surveys algorithms for the problem of scheduling jobs on a single machine to mini...
In this paper the NP-hard single machine total weighted tardiness scheduling problem in presence of ...
In this paper the NP-hard single machine total weighted tardiness scheduling problem in presence of ...
Tardiness related objectives are of utmost importance in production systems when client satisfaction...
We propose a hybrid algorithm based on the ant colony optimization (ACO) meta-heuristic, in conjunct...
WOS: 000445126100021For the past few years, learning effect has been receiving wide attention in the...
The paper deals with the single machine scheduling problem where both total and maximum tardiness mu...
The single machine total weighted tardiness problem with sequence dependent setup times is a challen...
Most of the problems defined in the scheduling literature do not yet take into account the energy co...