Scheduling a batch processing machine with bipartite compatibility graphs

DOI10.1007/s001860300273zbMath1175.90158OpenAlexW1521831528MaRDI QIDQ1423703

Mourad Boudhar

Publication date: 7 March 2004

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860300273

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

The lockmaster's problem ⋮ Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs ⋮ An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities ⋮ Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines ⋮ Partitioning a weighted partial order ⋮ Batch processing with interval graph compatibilities between tasks ⋮ Scheduling an unbounded batching machine with job processing time compatibilities ⋮ Single-machine batch scheduling with job processing time compatibility ⋮ Scheduling on a batch processing machine with split compatibility graphs