Minimizing number of tardy jobs on a batch processing machine with incompatible job families
type: Item
instance of: scholarly article
title: Minimizing number of tardy jobs on a batch processing machine with incompatible job families
zbMATH Open document ID: 1132.90326
author: Fariborz Jolai
published in: European Journal of Operational Research
publication date: 2005-02-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 2132782
zbMATH Keywords: Scheduling
zbMATH Keywords: Batch processing machine
zbMATH Keywords: Number of tardy jobs criteria
zbMATH Keywords: Dynamic programming
MaRDI profile type: Publication
full work available at URL: j.ejor.2003.10.011
OpenAlex ID: W2137903142
cites work: Batching and Scheduling Jobs on Batch and Discrete Processors
cites work: Scheduling a batching machine
cites work: Papers presented at the workshop on discrete algorithms, University of Osnabrück, Germany, July 10-12, 1991
cites work: Minimizing total completion time on a batch processing machine with job families
cites work: Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: Reducibility among Combinatorial Problems
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: Scheduling with agreeable release times and due dates on a batch processing machine
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
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.1016/J.EJOR.2003.10.011
description: scientific article; zbMATH DE number 2132782