Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem

DOI10.1287/IJOC.10.3.341MaRDI QIDQ4427354zbMATH OpenOpenAlexFDO

Authors H. A. J. Crauwels, Chris N. Potts, Luk N. Van Wassenhove

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(21)

• 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
• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Solving multi-objective production scheduling problems using metaheuristics
• An exact algorithm for single-machine scheduling without machine idle time
• Predictive-reactive scheduling on a single resource with uncertain future jobs
• \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
• A hybrid metaheuristic for the single-machine total weighted tardiness problem
• Network construction problems with due dates
• Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
• An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
• An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
• A new dominance rule to minimize total weighted tardiness with unequal release dates.
• On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification
• New ideas in Lagrangian relaxation for a scheduling problem with the weighted tardiness criterion
• A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
• A computational evaluation of new and existing dispatching rules for the single machine total weighted tardiness problem
• A tabu search algorithm for the single machine total weighted tardiness problem
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem

This page was built for publication: Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427354)