Science Forums: Filling a table of employee shifts - Science Forums

Jump to content

Welcome to ScienceForums.Net!

Welcome to ScienceForums.Net! We welcome science discussion at all levels — from beginners to researchers, covering topics from biology to computer science, and much more. Registration is fast and free, and allows you to post on the forums, so register now and join the discussions!
  
After you've registered, come in and introduce yourself, or visit the forum index. If you need any help  registering, posting, or if you just have some questions about our site, please feel free to contact us at staff at scienceforums dot net.

  • Start new topics and reply to others
  • Subscribe to topics and forums to get automatic updates
  • Create a ScienceForums.Net Blog!
Guest Message © 2012 DevFuse
  • 2 Pages +
  • 1
  • 2
  • You cannot start a new topic
  • You cannot reply to this topic

Filling a table of employee shifts Rate Topic: -----

#21 2 March 2012 - 05:35 PM khaled 


Meson

View Postkhaled, on 1 March 2012 - 09:38 PM, said:

3. I didn't say that NSP is NP-hard, I said scheduling problems are NP-Hard, they can be reduced to CSP\SAT


The most basic NP problem is Binary-SAT, so scheduling problems that has at least 2 basic constraints are NP-Hard

If there exist a scheduling problem that has 1 basic constraint, or no constraints .. these two variations are not NP
Everything is a graph

twitter: @khaledkhunaifer, Blog: KhaledKhunaifer:Blog
0

Share this topic:


  • 2 Pages +
  • 1
  • 2
  • You cannot start a new topic
  • You cannot reply to this topic

1 User(s) are reading this topic
0 members, 1 guests, 0 anonymous users