Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
type: Item
instance of: scholarly article
title: Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
zbMATH Open document ID: 0913.90165
DOI: 10.1016/0377-2217(95)00349-5
author: H. A. J. Crauwels
author: Chris N. Potts
author: Luk N. Van Wassenhove
published in: European Journal of Operational Research
publication date: 1998-11-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1208473
zbMATH Keywords: local search heuristics
zbMATH Keywords: single machine
zbMATH Keywords: set-up time
zbMATH Keywords: number of late jobs
zbMATH Keywords: multi-start descent
zbMATH Keywords: simulated annealing
zbMATH Keywords: tabu search
zbMATH Keywords: genetic algorithm
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00349-5
OpenAlex ID: W2026188274
cites work: Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
cites work: Simulated annealing: A tool for operational research
cites work: Tabu Search—Part I
cites work: Q4692508
cites work: Optimization by Simulated Annealing
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Q4031974
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
description: scientific article; zbMATH DE number 1208473