Solving job shop problems in the context of hypergraphs
Author:
- 14 September 2012
- journal article
- research article
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 21 (S1) , 27-40
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Horn Renamability and HypergraphsJournal of Computing and Information Technology, 2009
- Scheduling Practice and Recent Developments in Flow Shop and Job Shop Scheduling2009
- Sensitivity results considering rescheduling by AND/OR graphsInternational Journal of Production Economics, 2005
- Searching for a minimal solution subgraph in explicit AND/OR graphsDiscrete Applied Mathematics, 2001
- Deterministic job-shop scheduling: Past, present and futureEuropean Journal of Operational Research, 1999
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction searchArtificial Intelligence, 1994
- Directed hypergraphs and applicationsDiscrete Applied Mathematics, 1993