کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
478596 | 1446115 | 2010 | 4 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: “Product Partition” and related problems of scheduling and systems reliability: Computational complexity and approximation “Product Partition” and related problems of scheduling and systems reliability: Computational complexity and approximation](/preview/png/478596.png)
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.
Journal: European Journal of Operational Research - Volume 207, Issue 2, 1 December 2010, Pages 601–604