Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups

DOI10.1016/j.tcs.2012.01.043zbMath1242.68291MaRDI QIDQ428876

Hsin-Hui Tsou, Ching-Jong Liao, Kuo-Ling Huang

Publication date: 25 June 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.043

zbMATH Keywords

single machine; neighborhood; weighted tardiness; sequence-dependent setups

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

The third comprehensive survey on scheduling problems with setup times/costs, A destroy and repair algorithm for the bike sharing rebalancing problem, Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, Scatter search for minimizing weighted tardiness in a single machine scheduling with setups

Cites Work

• Unnamed Item
• Unnamed Item
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
• An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
• Scheduling in a sequence dependent setup environment with genetic search
• Approximation algorithms for minimizing the total weighted tardiness on a single machine
• Fast neighborhood search for the single machine total weighted tardiness problem
• Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
• A memetic algorithm for the total tardiness single machine scheduling problem