The complexity of one-machine batching problems
type: Item
instance of: scholarly article
title: The complexity of one-machine batching problems
zbMATH Open document ID: 0792.90035
DOI: 10.1016/0166-218X(93)90085-3
author: Susanne Albers
author: Peter Brucker
published in: Discrete Applied Mathematics
publication date: 1994-07-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 516866
zbMATH Keywords: batching
zbMATH Keywords: sequencing
zbMATH Keywords: partitioning
zbMATH Keywords: shortest path problem
zbMATH Keywords: NP-hard
MaRDI profile type: Publication
cites work: Optimal Scheduling of Products with Two Subassemblies on a Single Machine
cites work: Batch sizing and job sequencing on a single machine
cites work: Batching to Minimize Flow Times on One Machine
cites work: One-pass batching algorithms for the one-machine problem
cites work: Batching in single operation manufacturing systems
description: scientific article; zbMATH DE number 516866