Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. General Programming
  3. Algorithms
  4. Timetable algorithm

Timetable algorithm

Scheduled Pinned Locked Moved Algorithms
csharpasp-netdesignalgorithmsquestion
7 Posts 5 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • S Offline
    S Offline
    Slick69
    wrote on last edited by
    #1

    Hello everyone.. I am planning to design a timetable system for my 3rd year project. I would like to know what is the best algorithm to use for this. will be doing my system in C#, will also have a website using ASP.NET! I want a algorithm that is simple and easy to understand - nothing complex. i'm no einstein. :-O

    P C D 3 Replies Last reply
    0
    • S Slick69

      Hello everyone.. I am planning to design a timetable system for my 3rd year project. I would like to know what is the best algorithm to use for this. will be doing my system in C#, will also have a website using ASP.NET! I want a algorithm that is simple and easy to understand - nothing complex. i'm no einstein. :-O

      P Offline
      P Offline
      Paul Conrad
      wrote on last edited by
      #2

      That is a pretty broad post there. What ideas have you come up with?

      "Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks" - Pete O'Hanlon

      S 1 Reply Last reply
      0
      • S Slick69

        Hello everyone.. I am planning to design a timetable system for my 3rd year project. I would like to know what is the best algorithm to use for this. will be doing my system in C#, will also have a website using ASP.NET! I want a algorithm that is simple and easy to understand - nothing complex. i'm no einstein. :-O

        C Offline
        C Offline
        Colin Angus Mackay
        wrote on last edited by
        #3

        Angel69 wrote:

        I am planning to design a timetable system for my 3rd year project. I would like to know what is the best algorithm to use for this.

        Algorithm to do what? Work out how to put the timetable together? As I recall some research fellows at my University were attempting to work out the best algorithm when I was there 14 years ago. There results were a disaster. The department used their software and nobody liked the time tables it produced.

        Upcoming FREE developer events: * Developer Day Scotland Recent blog posts: * Mixins in C#3.0 My website | Blog

        1 Reply Last reply
        0
        • P Paul Conrad

          That is a pretty broad post there. What ideas have you come up with?

          "Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks" - Pete O'Hanlon

          S Offline
          S Offline
          Slick69
          wrote on last edited by
          #4

          Its going to be a timetable system that schedules timetables for maybe a university or highschool but right now am looking to base it for the university.. should be able to schedule in the venues - check if venue is big enough for the amount of students in that certain course\module. allocate resources to rooms(resources needed to carry out a lecture) assign lecturers to courses, check for clashes. from whatever information you put into the system - student, lecturer, rooms can have personalised timetable.. dont know if this helps! someone suggested that i will need to use a scheduling\timetabling algorithm to be able to do this. am not sure.. :confused:

          1 Reply Last reply
          0
          • S Slick69

            Hello everyone.. I am planning to design a timetable system for my 3rd year project. I would like to know what is the best algorithm to use for this. will be doing my system in C#, will also have a website using ASP.NET! I want a algorithm that is simple and easy to understand - nothing complex. i'm no einstein. :-O

            D Offline
            D Offline
            Dexterus
            wrote on last edited by
            #5

            Afaik it might be NP-hard so bad luck there with the simple part. As in you'll never get optimal result in a polinomial time so very fast your program will have to be running for months to get a full result.

            D 1 Reply Last reply
            0
            • D Dexterus

              Afaik it might be NP-hard so bad luck there with the simple part. As in you'll never get optimal result in a polinomial time so very fast your program will have to be running for months to get a full result.

              D Offline
              D Offline
              Dan Neely
              wrote on last edited by
              #6

              that would be my concern as well. I have no way to prove it but making that sort of schedule seems reminiscent of the knapsack problem which is NP-Complete.

              Otherwise [Microsoft is] toast in the long term no matter how much money they've got. They would be already if the Linux community didn't have it's head so firmly up it's own command line buffer that it looks like taking 15 years to find the desktop. -- Matthew Faithfull

              P 1 Reply Last reply
              0
              • D Dan Neely

                that would be my concern as well. I have no way to prove it but making that sort of schedule seems reminiscent of the knapsack problem which is NP-Complete.

                Otherwise [Microsoft is] toast in the long term no matter how much money they've got. They would be already if the Linux community didn't have it's head so firmly up it's own command line buffer that it looks like taking 15 years to find the desktop. -- Matthew Faithfull

                P Offline
                P Offline
                Paul Conrad
                wrote on last edited by
                #7

                wrote:

                making that sort of schedule seems reminiscent of the knapsack problem which is NP-Complete.

                I remember my Algorithms Analysis professor talk about this very thing.

                "I guess it's what separates the professionals from the drag and drop, girly wirly, namby pamby, wishy washy, can't code for crap types." - Pete O'Hanlon

                1 Reply Last reply
                0
                Reply
                • Reply as topic
                Log in to reply
                • Oldest to Newest
                • Newest to Oldest
                • Most Votes


                • Login

                • Don't have an account? Register

                • Login or register to search.
                • First post
                  Last post
                0
                • Categories
                • Recent
                • Tags
                • Popular
                • World
                • Users
                • Groups