Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
From MaRDI portal
Publication:4427354
DOI10.1287/ijoc.10.3.341zbMath1092.90516OpenAlexW2160657530MaRDI QIDQ4427354
Luk N. Van Wassenhove, H. A. J. Crauwels, Chris N. Potts
Publication date: 16 December 2003
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0da73177f313d117a3df45bd40c38ec38f126194
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Solving multi-objective production scheduling problems using metaheuristics ⋮ Network construction problems with due dates ⋮ An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments ⋮ A tabu search algorithm for the single machine total weighted tardiness problem ⋮ On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification ⋮ Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem ⋮ Predictive-reactive scheduling on a single resource with uncertain future jobs ⋮ Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem ⋮ An exact algorithm for single-machine scheduling without machine idle time ⋮ \(\text{MA}\mid\text{PM}\): memetic algorithms with population management ⋮ A new dominance rule to minimize total weighted tardiness with unequal release dates. ⋮ A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM ⋮ A population-based variable neighborhood search for the single machine total weighted tardiness problem ⋮ Interval-indexed formulation based heuristics for single machine total weighted tardiness problem ⋮ An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments ⋮ Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties ⋮ Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
This page was built for publication: Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem