Scheduling with batching: Minimizing the weighted number of tardy jobs
type: Item
instance of: scholarly article
title: Scheduling with batching: Minimizing the weighted number of tardy jobs
zbMATH Open document ID: 0820.90052
DOI: 10.1016/0167-6377(94)90063-9
author: Dorit S. Hochbaum
author: Dan Landy
published in: Operations Research Letters
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 710264
zbMATH Keywords: semiconductor manufacturing
zbMATH Keywords: weighted tardiness with batching
zbMATH Keywords: processing time
zbMATH Keywords: due date
zbMATH Keywords: pseudo-polynomial time
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: 0167-6377(94)90063-9
OpenAlex ID: W2014889423
cites work: The complexity of one-machine batching problems
cites work: Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
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: Q4142699
cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
cites work: One-pass batching algorithms for the one-machine problem
cites work: A polynomial algorithm for a one machine batching problem
description: scientific article; zbMATH DE number 710264