Scheduling on a batch processing machine with split compatibility graphs

DOI10.1007/s10852-005-3083-zzbMath1086.90018OpenAlexW2053049300MaRDI QIDQ2583507

Mourad Boudhar

Publication date: 17 January 2006

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

Full work available at URL: https://doi.org/10.1007/s10852-005-3083-z

zbMATH Keywords

split graphbatch processing machinebatch schedulingcompatibility graph

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines ⋮ Clique partitioning with value-monotone submodular cost ⋮ Scheduling on a batch processing machine with split compatibility graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient scheduling algorithms for a single batch processing machine
• Scheduling a batching machine
• Scheduling with agreeable release times and due dates on a batch processing machine
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Dynamic scheduling on a single batch processing machine with split compatibility graphs
• Scheduling a batch processing machine with bipartite compatibility graphs
• Scheduling with batching: A review
• Minimizing total completion time on a batch processing machine with job families
• Scheduling on a batch processing machine with split compatibility graphs
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Scheduling batch processing machines with incompatible job families

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