On the complexity of minimizing the number of late jobs in unit time open shop
type: Item
instance of: scholarly article
title: On the complexity of minimizing the number of late jobs in unit time open shop
zbMATH Open document ID: 0971.90030
DOI: 10.1016/S0166-218X(99)00202-4
author: Svetlana A. Kravchenko
published in: Discrete Applied Mathematics
publication date: 2000-01-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1394996
zbMATH Keywords: complexity
zbMATH Keywords: unit time open shop
zbMATH Keywords: unary NP-hard
MaRDI profile type: Publication
cites work: Open shop problems with unit time operations
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: On complexity of minimizing weighted number of late jobs in unit time open shops
description: scientific article; zbMATH DE number 1394996