Solving job shop problems in the context of hypergraphs

DOI10.1007/S10100-012-0268-1MaRDI QIDQ351548zbMATH OpenOpenAlexFDO

Authors 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

schedulinghypergraphjob shop problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4099024
• scientific article; zbMATH DE number 3978803
• Optimal job-shop scheduling with two jobs in systems with unrestricted paths
• The disjunctive graph machine representation of the job shop scheduling problem
• On an optimization problem occurring in FMSs: A hypergraph-theoretical formulation

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
• Deterministic job-shop scheduling: Past, present and future
• Directed hypergraphs and applications
• Searching for a minimal solution subgraph in explicit AND/OR graphs

Cited in

(1)

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

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

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