Dynamic scheduling on a single batch processing machine with split compatibility graphs

DOI10.1023/A:1023669107449zbMath1028.90015OpenAlexW1499543701MaRDI QIDQ1398019

Mourad Boudhar

Publication date: 6 August 2003

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1023669107449

zbMATH Keywords

split graphbatch processing machinebatch schedulingcompatibility graph

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs ⋮ No-Wait Scheduling Problems with Batching Machines ⋮ Capacitated max-batching with interval graph compatibilities ⋮ Clique partitioning of interval graphs with submodular costs on the cliques ⋮ Batch processing with interval graph compatibilities between tasks ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Scheduling incompatible tasks on two machines ⋮ Scheduling on a batch processing machine with split compatibility graphs

This page was built for publication: Dynamic scheduling on a single batch processing machine with split compatibility graphs