Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
type: Item
instance of: scholarly article
title: Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
zbMATH Open document ID: 1162.90462
author: J. Martínez
published in: Theoretical Computer Science
publication date: 2009-06-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5567389
zbMATH Keywords: scheduling
zbMATH Keywords: batch processing
zbMATH Keywords: agreeable
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.12.039
OpenAlex ID: W2045683291
cites work: Scheduling a batching machine
cites work: Survey of scheduling research involving due date determination decisions
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: Reducibility among Combinatorial Problems
cites work: Q4124332
cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Scheduling with agreeable release times and due dates on a batch processing machine
cites work: Scheduling one batch processor subject to job release dates
cites work: On scheduling an unbounded batch machine
DOI: 10.1016/J.TCS.2006.12.039
description: scientific article; zbMATH DE number 5567389