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

DOI10.1016/J.TCS.2012.01.043MaRDI QIDQ428876zbMATH OpenOpenAlexFDO

Authors Ching-Jong Liao, Hsin-Hui Tsou, 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 machineneighborhoodsequence-dependent setupsweighted tardiness

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Fast neighborhood search for the single machine total weighted tardiness problem
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
• Fast neighborhood search for the single machine earliness-tardiness scheduling problem
• Algorithms for single machine total tardiness scheduling with sequence dependent setups
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
• A memetic algorithm for the total tardiness single machine scheduling problem
• An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
• Approximation algorithms for minimizing the total weighted tardiness on a single machine
• Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
• Fast neighborhood search for the single machine total weighted tardiness problem
• Scheduling in a sequence dependent setup environment with genetic search

Cited in

(12)

• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
• Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
• Fast neighborhood search for the single machine total weighted tardiness problem
• Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
• The third comprehensive survey on scheduling problems with setup times/costs
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
• A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
• A destroy and repair algorithm for the bike sharing rebalancing problem
• Fast neighborhood search for the single machine earliness-tardiness scheduling problem

This page was built for publication: Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups

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