Scheduling jobs with agreeable processing times and due dates on a single batch processing machine

DOI10.1016/J.TCS.2006.12.039zbMath1162.90462OpenAlexW2045683291MaRDI QIDQ1022597

J. Martínez

Publication date: 22 June 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.039

zbMATH Keywords

schedulingbatch processingagreeable

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A constraint programming approach for a batch processing problem with non-identical job sizes ⋮ A survey of scheduling with parallel batch (p-batch) processing

Cites Work

• Unnamed Item
• Efficient scheduling algorithms for a single batch processing machine
• Survey of scheduling research involving due date determination decisions
• Scheduling a batching machine
• Scheduling with agreeable release times and due dates on a batch processing machine
• Scheduling one batch processor subject to job release dates
• On scheduling an unbounded batch machine
• Minimizing Total Tardiness on One Machine is NP-Hard
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Reducibility among Combinatorial Problems
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: Scheduling jobs with agreeable processing times and due dates on a single batch processing machine