Back to Search Start Over

Solving job shop problems in the context of hypergraphs.

Authors :
Hvalica, Dušan
Source :
Central European Journal of Operations Research; Jun2013 Supplement, Vol. 21, p27-40, 14p
Publication Year :
2013

Abstract

A class of hypergraphs, called $$B$$-tails, is introduced. It is shown that a certain hypergraph can be assigned to any job shop problem in such a way that minimal $$B$$-tails correspond to optimal schedules. An algorithm for searching for a minimal $$B$$-tail is described. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
PRODUCTION scheduling
PROBLEM solving
HYPERGRAPHS
ALGORITHMS
SEARCH algorithms
GRAPH theory

Details

Language :
English
ISSN :
1435246X
Volume :
21
Database :
Complementary Index
Journal :
Central European Journal of Operations Research
Publication Type :
Academic Journal
Accession number :
87563799
Full Text :
https://doi.org/10.1007/s10100-012-0268-1
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details