English, Article edition: Minimizing the number of machines for minimum length schedules Finke, Gerd; Lemaire, Pierre; Proth, Jean-Marie; ...

User activity

Share to:
 
Bookmark: http://trove.nla.gov.au/version/10653
Physical Description
  • article
Language
  • English

Edition details

Title
  • Minimizing the number of machines for minimum length schedules
Author
  • Finke, Gerd
  • Lemaire, Pierre
  • Proth, Jean-Marie
  • Queyranne, Maurice
Physical Description
  • article
Notes
  • In this paper, we present a new objective function for scheduling on parallel machines: minimizing the number of machines for schedules of minimum length. We study its complexity and we prove the NP-completeness of this problem, even if there is no precedences or for unitary execution times. We propose several polynomial algorithms for various particular cases.
  • Parallel scheduling Complexity Minimum number of processors
  • RePEc:eee:ejores:v:199:y:2009:i:3:p:702-705
Language
  • English
Contributed by
OAIster

Get this edition

Other links

  • Set up My libraries

    How do I set up "My libraries"?

    In order to set up a list of libraries that you have access to, you must first login or sign up. Then set up a personal list of libraries from your profile page by clicking on your user name at the top right of any screen.

  • All (1)
  • Unknown (1)
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.

User activity


e.g. test cricket, Perth (WA), "Parkes, Henry"

Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.

Be the first to add a tag for this edition

Be the first to add this to a list

Comments and reviews

What are comments? Add a comment

No user comments or reviews for this version

Add a comment