Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time.

Research output: Contribution to journalArticleAcademicpeer-review

Original languageUndefined/Unknown
Pages (from-to)205-208
JournalOper. Res. Lett.
Volume17
Issue number5
DOIs
Publication statusPublished - 1995

Bibliographical note

DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

Cite this