Batch Scheduling with Time Restriction and Clique Search

DOI10.1556/314.2023.00004MaRDI QIDQ6097411zbMATH OpenOpenAlexFDO

Authors Sándor Szabó

Publication date 5 June 2023

Published in Mathematica Pannonica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1556/314.2023.00004

zbMATH Keywords

clique and chromatic numberspractical solution of NP-hard problems

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Coloring of graphs and hypergraphs (05C15) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A clique search problem and its application to machine scheduling
• Time slot scheduling of compatible jobs
• A hypocoloring model for batch scheduling
• Edge-Chromatic Scheduling with Simultaneity Constraints
• scientific article; zbMATH DE number 4072696

Cited in

(2)

• A clique search problem and its application to machine scheduling
• Extended clique initialisation in examination timetabling

This page was built for publication: Batch Scheduling with Time Restriction and Clique Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097411)