Multiple orders per job batch scheduling with incompatible jobs
type: Item
instance of: scholarly article
title: Multiple orders per job batch scheduling with incompatible jobs
zbMATH Open document ID: 1153.90420
author: Vishnu Erramilli
author: Scott J. Mason
published in: Annals of Operations Research
publication date: 2008-09-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 5320614
MaRDI profile type: Publication
full work available at URL: s10479-007-0286-x
OpenAlex ID: W2003566225
cites work: Batching and Scheduling Jobs on Batch and Discrete Processors
cites work: The Batch Loading and Scheduling Problem
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
cites work: Scheduling a single batch processing machine with non-identical job sizes
cites work: Scheduling batch processing machines with incompatible job families
DOI: 10.1007/S10479-007-0286-X
description: scientific article; zbMATH DE number 5320614