TY - INPR
A1 - Schauer, Joachim
A1 - Schwarz, Cornelius
T1 - A generalized job-shop problem with more than one resource demand per task
N2 - We study a generalized job-shop problem called the Laser Sharing Problem with fixed tours (LSP-T) where the tasks may need more than one resource simultaneously. This fact will be used to model possible collisions between industrial robots. For three robots we will show that the special case where only one resource is used by more than one robot is already NP-hard. This also implies that one machine scheduling with chained min delay precedence constraints is NP-hard for at least three chains. On the positive side, we present a polynomial algorithm for the two robot case and a pseudo-polynomial algorithm together with an FPTAS for an arbitrary but constant number of robots. This gives a sharp boundary of the complexity status for a constant number of robots.
KW - Reihenfolgeproblem
KW - Kombinatorische Optimierung
KW - Komplexitaet
KW - Approximationsalgorithmus
KW - FPTAS
KW - complexity
KW - job-shop
KW - transversal graph
Y1 - 2011
UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:703-opus-8381
UR - http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/661
ER -