Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem without missing operations

Research output: Unpublished conference presentation (presented paper, abstract, poster)Conference presentation (not published in journal/proceeding/book)Academic researchpeer-review

Original languageEnglish
Publication statusPublished - 2003
EventGlobal Conference on Business & Economics -
Duration: 1 Jan 2003 → …


ConferenceGlobal Conference on Business & Economics
Period1/01/03 → …

Cite this