Title of article
The time dependent machine makespan problem is strongly NP-complete
Author/Authors
T.C.E. Cheng، نويسنده , , Q. Ding، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1999
Pages
6
From page
749
To page
754
Abstract
The computational complexity of the problem of scheduling a set of start-time dependent tasks with deadlines and identical decreasing rates of processing times on a single machine to minimize the makespan is open. In this paper we show that the problem is strongly NP-complete by a reduction from 3-Partition.
Keywords
Sequencing , Time dependence , Computational complexity , Scheduling
Journal title
Computers and Operations Research
Serial Year
1999
Journal title
Computers and Operations Research
Record number
927032
Link To Document