Talk:Uniform-machines scheduling

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

NP-Completeness

Does a paper exists thar demonstrates that particular case ofschedling is indeed NP-Complete ? I'm looking for one ;-) French-jamian 21:02, 9 September 2007 (UTC)[reply]

I bet you're still looking for an answer, some five years later. :) This article gives the following two references to support the fact that the Multiprocessor Scheduling Problem is NP-hard:

M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness (Freeman, New York, 1997).
S. Mertens, Comput. Sci. Eng. 4, 31 (2002).

If I understand correctly, this article shouldn't say "NP-complete" since that only applies to decision (yes/no) problems. /skagedal^talk 08:10, 26 January 2012 (UTC)[reply]