Please use this identifier to cite or link to this item:
Title: Deterministic scheduling problems with multiprocessor tasks : nP-hardness results, polynomially solvable cases and approximation algorithms
Authors: Lichtenstein, MA
Oguz, C
Do, VH
Zinder, Y
Issue Date: 2001
Source: Proceedings of Fifth Workshop on Models and Algorithms for Planning and Scheduling Problems, Aussois, France, 17-22 June 2001, p. 95-96 How to cite?
Appears in Collections:Conference Paper

Show full item record

Page view(s)

Last Week
Last month
Citations as of Feb 19, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.