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. The Lounge
  3. Need some suggestions

Need some suggestions

Scheduled Pinned Locked Moved The Lounge
algorithmshelpquestion
8 Posts 7 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.
  • M Offline
    M Offline
    mango_lier
    wrote on last edited by
    #1

    I am banging my head for the last couple of days to solve this problem. I have 8 test setups and about 300 test cases. These test cases take from 1 minute to 4 day to complete. How can one schedule these cases to finish all of these in minimum amount of time? Is there an algorithm to solve this kind of problem?

    L M N M J 5 Replies Last reply
    0
    • M mango_lier

      I am banging my head for the last couple of days to solve this problem. I have 8 test setups and about 300 test cases. These test cases take from 1 minute to 4 day to complete. How can one schedule these cases to finish all of these in minimum amount of time? Is there an algorithm to solve this kind of problem?

      L Offline
      L Offline
      Lost User
      wrote on last edited by
      #2

      Parallel testing. The tigress is here :-D

      1 Reply Last reply
      0
      • M mango_lier

        I am banging my head for the last couple of days to solve this problem. I have 8 test setups and about 300 test cases. These test cases take from 1 minute to 4 day to complete. How can one schedule these cases to finish all of these in minimum amount of time? Is there an algorithm to solve this kind of problem?

        M Offline
        M Offline
        Marc Clifton
        wrote on last edited by
        #3

        mango_lier wrote: I am banging my head for the last couple of days to solve this problem. Thanks, now I have a headache too! Uh, without further information (and without something that doesn't look like a disguised homework assignment :-D ) it's really hard to give you any advice. Marc MyXaml Advanced Unit Testing YAPO

        J 1 Reply Last reply
        0
        • M mango_lier

          I am banging my head for the last couple of days to solve this problem. I have 8 test setups and about 300 test cases. These test cases take from 1 minute to 4 day to complete. How can one schedule these cases to finish all of these in minimum amount of time? Is there an algorithm to solve this kind of problem?

          N Offline
          N Offline
          Navin
          wrote on last edited by
          #4

          Monkeys. The generation of random numbers is too important to be left to chance.

          1 Reply Last reply
          0
          • M mango_lier

            I am banging my head for the last couple of days to solve this problem. I have 8 test setups and about 300 test cases. These test cases take from 1 minute to 4 day to complete. How can one schedule these cases to finish all of these in minimum amount of time? Is there an algorithm to solve this kind of problem?

            M Offline
            M Offline
            mango_lier
            wrote on last edited by
            #5

            I think I found the solution. http://128.32.125.151/riot/Applications/Scheduling/[^]

            1 Reply Last reply
            0
            • M Marc Clifton

              mango_lier wrote: I am banging my head for the last couple of days to solve this problem. Thanks, now I have a headache too! Uh, without further information (and without something that doesn't look like a disguised homework assignment :-D ) it's really hard to give you any advice. Marc MyXaml Advanced Unit Testing YAPO

              J Offline
              J Offline
              Jim Crafton
              wrote on last edited by
              #6

              Marc Clifton wrote: a disguised homework assignment :omg: Not the dreaded "disguised homework assignment"? Surely no one here would attempt something as foolish, transparent, and juvenile as that! :-D ¡El diablo está en mis pantalones! ¡Mire, mire! Real Mentats use only 100% pure, unfooled around with Sapho Juice(tm)! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF!

              1 Reply Last reply
              0
              • M mango_lier

                I am banging my head for the last couple of days to solve this problem. I have 8 test setups and about 300 test cases. These test cases take from 1 minute to 4 day to complete. How can one schedule these cases to finish all of these in minimum amount of time? Is there an algorithm to solve this kind of problem?

                J Offline
                J Offline
                Joe Woodbury
                wrote on last edited by
                #7

                Assign the longest test case and the shortest test case to each system in turn until you run out. Here, they set up a system where test are queued up. When a test finishes, the system requests another test from the queue. Anyone who thinks he has a better idea of what's good for people than people do is a swine. - P.J. O'Rourke

                K 1 Reply Last reply
                0
                • J Joe Woodbury

                  Assign the longest test case and the shortest test case to each system in turn until you run out. Here, they set up a system where test are queued up. When a test finishes, the system requests another test from the queue. Anyone who thinks he has a better idea of what's good for people than people do is a swine. - P.J. O'Rourke

                  K Offline
                  K Offline
                  Kastellanos Nikos
                  wrote on last edited by
                  #8

                  You are close .... What he has to do is construct a huffman tree with the times of each testcase. By the time he get 8 subtrees he can stop, each subtree is a collection of jobs for a single workstation. - - - - - - - - - - - - - - - - - - Memory leaks is the price we pay \0 01234567890123456789012345678901234

                  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