A simulated annealing algorithm for single machine scheduling problems with family setups

DOI10.1016/j.cor.2008.08.001zbMath1158.90348MaRDI QIDQ1013384

Cheng Wu, Feng Jin, Shi-ji Song

Publication date: 17 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.001

zbMATH Keywords

simulated annealing; single machine; family setups; neighborhood property

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

An iterative approach for the serial batching problem with parallel machines and job families, Temporary workforce planning with firm contracts: a model and a simulated annealing heuristic, Scheduling with families of jobs and delivery coordination under job availability, A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups

Cites Work

• Unnamed Item
• The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
• Batch scheduling to minimize maximum lateness
• Single machine scheduling with batch set-up times to minimize maximum lateness
• Minimizing maximum lateness with job families
• Scheduling with batching: A review
• Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
• The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
• A survey of scheduling problems with setup times or costs
• On the Complexity of Scheduling with Batch Setup Times
• Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
• Minimizing L _max for the single machine scheduling problem with family set-ups
• Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach
• Scheduling Groups of Jobs on a Single Machine