Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
From MaRDI portal
Publication:1374439
DOI10.1023/A:1018978322417zbMath0890.90095MaRDI QIDQ1374439
H. A. J. Crauwels, Luk N. Van Wassenhove, Chris N. Potts
Publication date: 4 December 1997
Published in: Annals of Operations Research (Search for Journal in Brave)
simulated annealingtabu searchsingle machinethreshold acceptingtotal weighted completion timemulti-start descent
Related Items
Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation ⋮ An iterative approach for the serial batching problem with parallel machines and job families ⋮ An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times ⋮ Dynamic scheduling of aircraft landings ⋮ Optimization of setup times in the furniture industry ⋮ Scheduling with batching: A review ⋮ Lower bounds and algorithms for flowtime minimization on a single machine with set-up times ⋮ Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption ⋮ Approximation algorithms for problems in scheduling with set-ups ⋮ An online algorithm for a problem in scheduling with set-ups and release times ⋮ A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines ⋮ A simulated annealing approach to minimize the maximum lateness on uniform parallel machines ⋮ Heuristic methods for the identical parallel machine flowtime problem with set-up times ⋮ Two-machine flowshop scheduling with job class setups to minimize total flowtime ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization ⋮ Two simulated annealing-based heuristics for the job shop scheduling problem
