Sequencing with earliness and tardiness penalties: a review
Operations Research
Minimizing total tardiness on one machine is NP-hard
Mathematics of Operations Research
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Parallel machine scheduling with earliness and tardiness penalties
Computers and Operations Research
Scheduling jobs on parallel machines applying neural network and heuristic rules
Computers and Industrial Engineering
Tabu Search
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
A tabu search algorithm for parallel machine total tardiness problem
Computers and Operations Research
Expert Systems with Applications: An International Journal
Computers and Operations Research
Planning production using mathematical programming: The case of a woodturning company
Computers and Operations Research
Expert Systems with Applications: An International Journal
Computers and Operations Research
Integrating parts design characteristics and scheduling on parallel machines
Expert Systems with Applications: An International Journal
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
Computers and Operations Research
Journal of Intelligent Manufacturing
Parallel-machine scheduling to minimize tardiness penalty and power cost
Computers and Industrial Engineering
Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates
International Journal of Applied Evolutionary Computation
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
Computers and Operations Research
Hi-index | 0.01 |
This work proposes a hybrid metaheuristic (HMH) approach which integrates several features from tabu search (TS), simulated annealing (SA) and variable neighbourhood search (VNS) in a new configurable scheduling algorithm. In particular, either a deterministic or a random candidate list strategy can be used to generate the neighbourhood of a solution, both a tabu list mechanism and the SA probabilistic rule can be adopted to accept solutions, and the dimension of the explored neighbourhood can be dynamically modified. The considered class of scheduling problems is characterized by a set of independent jobs to be executed on a set of parallel machines with non-zero ready times and sequence dependent setups. In particular, the NP-hard generalized parallel machine total tardiness problem (GPMTP) recently defined by Bilge et al. [A tabu search algorithm for parallel machine total tardiness problem. Computers & Operations Research 2004;31:397-414], is faced. Several alternative configurations of the HMH have been tested on the same benchmark set used by Bilge et al. The results obtained highlight the appropriateness of the proposed approach. Algorithms based on metaheuristics have been quite extensively used to face scheduling problems and they are a valuable tool to provide high quality solutions. A metaheuristic describes principles and features that need to be tailored on the specific problem under concern to define a customized approach. This work aims to evaluate the possibility of defining a hybrid customizable neighbourhood search algorithm for combinatorial problems as a combination of a subset of concepts and features from three main metaheuristics of reference, i.e., the TS, the SA and the VNS. The proposed HMH approach is applied to the difficult problem of minimizing the total tardiness in parallel machines scheduling; in particular, a generalized version of such a problem has been considered, which makes it closer to several real industrial applications since it takes into account non-zero ready times, distinct due dates, uniform machines and setup times, recently proposed by Bilge et al. (A tabu search algorithm for parallel machine total tardiness problem. Computers & Operations Research 2004;31:397-414). To evaluate the effectiveness of the HMH for the generalized parallel machine total tardiness scheduling problem, a relevant benchmark available from the literature has been considered.