Minimizing total weighted tardiness in a generalized job shop

DOI10.1007/S10951-005-4779-7zbMath1123.90022OpenAlexW2127381850MaRDI QIDQ880516

K. M. J. De Bontridder

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-4779-7

Mathematics Subject Classification ID

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

Related Items (11)

Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation ⋮ A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem ⋮ A hybrid differential evolution and tree search algorithm for the job shop scheduling problem ⋮ A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm ⋮ An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective ⋮ Extended GRASP for the job shop scheduling problem with total weighted tardiness objective ⋮ The job shop scheduling problem with convex costs ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem

Cites Work

• A large step random walk for minimizing total weighted tardiness in a job shop
• Tabu search for resource-constrained scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Tabu Search—Part I
• Tabu Search—Part II
• A Computational Study of the Job-Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Job Shop Scheduling by Local Search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing total weighted tardiness in a generalized job shop