“Product Partition” and related problems of scheduling and systems reliability: Computational complexity and approximation

Problem Product Partition differs from the NP-complete problem Partition in that the addition operation is replaced by the multiplication operation. Furthermore it differs from the NP-complete problem Subset Product in that it does not contain the product value B in its input. We prove that problem...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 207; číslo 2; s. 601 - 604
Hlavní autoři: Ng, C.T., Barketau, M.S., Cheng, T.C.E., Kovalyov, Mikhail Y.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.12.2010
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Applied sciences
Approximation
Complexity theory
Complexity theory Scheduling Subset Product FPTAS Systems reliability
Computation
Exact sciences and technology
FPTAS
Mathematical analysis
Multiplication
Operational research
Operational research and scientific management
Operational research. Management science
Optimization
Optimization techniques
Partitions
Reliability
Reliability theory. Replacement problems
Scheduling
Scheduling, sequencing
Studies
Subset Product
System reliability
Systems reliability
Systems reliability
Scheduling
Complexity theory
FPTAS
Subset Product
Partition
Multiplication
Polynomial approximation
Processing time
Series system
Approximation algorithm
System reliability
Computational complexity
Optimization
Polynomial time
Time dependence
NP hard problem
NP complete problem
Execution time
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Problem Product Partition differs from the NP-complete problem Partition in that the addition operation is replaced by the multiplication operation. Furthermore it differs from the NP-complete problem Subset Product in that it does not contain the product value B in its input. We prove that problem Product Partition and several of its modifications are NP-complete in the strong sense. Our results imply the strong NP-hardness of a number of scheduling problems with start-time-dependent job processing times and a problem of designing a reliable system with a series–parallel structure. It should be noticed that the strong NP-hardness of the considered optimization problems does not preclude the existence of a fully polynomial time approximation scheme (FPTAS) for them. We present a simple FPTAS for one of these problems.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2010.05.034