Scheduling jobs with release dates on parallel batch processing machines

DOI10.1016/J.DAM.2008.12.012zbMath1164.90015OpenAlexW2007535515MaRDI QIDQ1026144

J. Blot

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.12.012

zbMATH Keywords

computational complexityschedulingrelease datesPTASparallel batch processing machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Integrated scheduling on a batch machine to minimize production, inventory and distribution costs ⋮ A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions ⋮ Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms

Cites Work

• Efficient scheduling algorithms for a single batch processing machine
• Scheduling a batching machine
• Approximation algorithms in batch processing
• A PTAS for semiconductor burn-in scheduling
• Minimizing makespan with release times on identical parallel batching machines
• On scheduling an unbounded batch machine
• Minimizing mean completion time in a batch processing system
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
• Computing and Combinatorics

This page was built for publication: Scheduling jobs with release dates on parallel batch processing machines