The complexity of customer order scheduling problems on parallel machines
type: Item
instance of: scholarly article
title: The complexity of customer order scheduling problems on parallel machines
zbMATH Open document ID: 1074.90021
author: Jaehwan Yang
published in: Computers \& Operations Research
publication date: 2005-05-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2168011
zbMATH Keywords: Batch scheduling
zbMATH Keywords: Kitting
zbMATH Keywords: Customer order scheduling
zbMATH Keywords: Computational complexity
MaRDI profile type: Publication
full work available at URL: j.cor.2003.12.008
OpenAlex ID: W2040089832
cites work: Batching and scheduling. Models and methods for several problem classes
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Scheduling Groups of Jobs on a Single Machine
cites work: Optimal Scheduling of Products with Two Subassemblies on a Single Machine
cites work: Batching in single operation manufacturing systems
cites work: Single machine hierarchical scheduling with customer orders and multiple job classes
cites work: Scheduling the production of two-component jobs on a single machine
cites work: The customer order lead-time problem on parallel machines
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4198056
DOI: 10.1016/J.COR.2003.12.008
description: scientific article; zbMATH DE number 2168011