Complexity of two dual criteria scheduling problems

Document Type

Article

Publication Date

3-1-2007

Abstract

In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. We show that both problems are binary NP-hard. © 2006 Elsevier B.V. All rights reserved.

Identifier

33847037972 (Scopus)

Publication Title

Operations Research Letters

External Full Text Location

https://doi.org/10.1016/j.orl.2006.01.007

ISSN

01676377

First Page

211

Last Page

220

Issue

2

Volume

35

Grant

DMI-0300156

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS