12,300,021 members (50,964 online)
Rate this:
See more:
I have a series of processes that I want to occur in the least amount of time.
Each Series has 4 consecutive parts, each component part may have different times in each series. The waits may be longer or shorter than the processes, The second waits must occur consecutively.
ProccessA
Wait1
ProcessB
Wait2
The processes cannot overlap, but the processes can occur while another series is waiting.
e.g.
```|________|--A--|--W1-----------|--B--|--W2--|
|_______________|--A--|--W1-----------|--B--|--W2--|
||--A--|--W1----------------------------------------------------------------|--B--|--W2--|```
I have defined the following arrays
StartTimeA[n] - The start times for each series
StartTimeB[n] - The start times for the ProcessB in each series
ATime[n] - The lengths of time for ProcessA
BTime[n] - The lengths of time for ProcessB
Wait1[n] - The initial waiting times for the series
Wait2[n] - The final waiting times for the series

I have tried a number of approaches, but am always getting some processes overlapping.
I would dearly appreciate a suggested algorithm. I will be implementing in c#.
Posted 18-Feb-13 8:08am
Edited 18-Feb-13 11:03am
v4
Sergey Alexandrovich Kryukov 18-Feb-13 14:19pm

Isn't it obvious that it's not always possible to plan processes without overlaps or gaps? Optimization is not eliminating them.
—SA

Rate this:

## Solution 1

If you want the best solution, you need to evaluate all permutations.
Often, a good enough solution is sufficient.

If you can define a "good enough" criterion, you can define a break condition to stop searching.
E.g. (pseudo code):
```iteration = MaxIterations;
best = none;
while (iteration-- > 0)
{
curr = GetNextPermutation();
best = Min(best, curr)
if (AcceptedLimit(curr)) break;
}
DoSomething(best);```
You have to design (not implement) first the `GetNextPermutation()` function, the `Min()` function, and the `AcceptedLimit()` functions.
Once you have an idea on these, you may talk about implementing these.
Cheers
Andi
v2

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Top Experts
Last 24hrsThis month
 Garth J Lancaster 220 Karthik Bangalore 220 Richard MacCutchan 205 ppolymorphe 150 OriginalGriff 137
 OriginalGriff 9,787 ppolymorphe 5,901 CHill60 5,497 Karthik Bangalore 5,276 Richard MacCutchan 5,099

Advertise | Privacy | Mobile
Web02 | 2.8.160525.2 | Last Updated 18 Feb 2013