A simulated annealing algorithm for single machine scheduling problems with family setups
type: Item
instance of: scholarly article
title: A simulated annealing algorithm for single machine scheduling problems with family setups
zbMATH Open document ID: 1158.90348
author: Feng Jin
author: Cheng Wu
author: Shiji Song
published in: Computers \& Operations Research
publication date: 2009-04-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5544735
zbMATH Keywords: single machine
zbMATH Keywords: family setups
zbMATH Keywords: simulated annealing
zbMATH Keywords: neighborhood property
MaRDI profile type: Publication
full work available at URL: j.cor.2008.08.001
OpenAlex ID: W2036831982
cites work: The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
cites work: The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
cites work: Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
cites work: Single machine scheduling with batch set-up times to minimize maximum lateness
cites work: Minimizing maximum lateness with job families
cites work: Q4943562
cites work: Minimizing L max for the single machine scheduling problem with family set-ups
cites work: Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: Batch scheduling to minimize maximum lateness
cites work: Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach
cites work: Scheduling with batching: A review
cites work: A survey of scheduling problems with setup times or costs
cites work: Scheduling Groups of Jobs on a Single Machine
DOI: 10.1016/J.COR.2008.08.001
description: scientific article; zbMATH DE number 5544735