Description: Maximum profit scheduling problem. Assumes that a machine can only deal with n-operation a1, a2 ,..., an, each job has a processing time tj, profit pj and deadline dj. Machine can only handle one operations, operations must be continuously run tj aj consecutive time units. If the job aj dj it completed before the deadline, then get profits pj, but only if the work completed at the deadline, you may return to 0. assumption that all processing time is an integer between 1 .. n. maximum profit scheduling problem requires to determine n-a subset of operations, makes the child focus on scheduling the biggest profits.
To Search:
File list (Check if you may need any files):
problem_one\problem_one.dsp
...........\problem_one.dsw
...........\Debug\vc60.idb
...........\.....\vc60.pdb
...........\.....\problem_one.pch
...........\.....\problem_one.ilk
...........\.....\problem_one.exe
...........\.....\problem_one.pdb
...........\.....\p1.obj
...........\problem_one.plg
...........\p1.cpp
...........\Debug
problem_one
Download