Answers are grounded in this paper and cite their sources.
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 19 January 1989Accepted: 04 April 1989Published online: 08 August 2006KeywordsNP-hard, pseudo-polynomial time, parallel task system, nonpreemptive scheduling, preemptive scheduling, schedule lengthAMS Subject Headings90B30, 68R05Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society for Industrial and Applied MathematicsCODEN: sjdmec
No takes yet. Share an insight, caveat, or question.
Du et al. (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: