Batch scheduling with deadlines on parallel machines
type: Item
instance of: scholarly article
title: Batch scheduling with deadlines on parallel machines
zbMATH Open document ID: 0913.90160
DOI: 10.1023/A:1018912114491
author: Peter Brucker
author: M. Y. Kovalyov
author: Y. Shafransky
author: Frank Werner
published in: Annals of Operations Research
publication date: 1999-03-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1229554
zbMATH Keywords: fully polynomial approximation scheme
zbMATH Keywords: computational complexity
zbMATH Keywords: parallel machines
zbMATH Keywords: batches
zbMATH Keywords: sequence-independent machine set-up time
zbMATH Keywords: NP-hard
MaRDI profile type: Publication
cites work: Q4198056
cites work: Scheduling with deadlines and loss functions
cites work: Q3525910
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Q4323632
cites work: Scheduling Groups of Jobs on a Single Machine
full work available at URL: a:1018912114491
OpenAlex ID: W1511517624
Wikidata QID: Q57633971
description: scientific article; zbMATH DE number 1229554