Search Results - "pseudo-polynomial dynamic programming algorithms"

Single machine scheduling with discretely controllable processing times

Authors: Zhi-Long Chen Qing Lu Guochun Tang

Source: Operations Research Letters. 21:69-76

Subject Terms: total completion time, controllable processing times, Deterministic scheduling theory in operations research, single machine, maximum tardiness, 0211 other engineering and technologies, makespan, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, Dynamic programming, sum of the total processing cost, pseudo-polynomial dynamic programming algorithms

File Description: application/xml

Access URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.7806
https://dblp.uni-trier.de/db/journals/orl/orl21.html#ChenLT97
https://www.sciencedirect.com/science/article/pii/S0167637797000102