Solving job shop problems in the context of hypergraphs

DOI10.1007/s10100-012-0268-1zbMath1267.90051OpenAlexW2013877525MaRDI QIDQ351548

Dušan Hvalica

Publication date: 8 July 2013

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-012-0268-1

zbMATH Keywords

hypergraphschedulingjob shop problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
• Directed hypergraphs and applications
• Deterministic job-shop scheduling: Past, present and future
• Searching for a minimal solution subgraph in explicit AND/OR graphs

This page was built for publication: Solving job shop problems in the context of hypergraphs