```Date: Wed, 14 Mar 2001 17:19:32 -0500 Reply-To: "Fehd, Ronald J." Sender: "SAS(r) Discussion" From: "Fehd, Ronald J." Subject: Re: A schedule problem Comments: To: Billy Content-Type: text/plain; charset="iso-8859-1" > From: Billy [mailto:bi933NOSPAM@SCN.ORG] > In a give time period (say 10 days), there are several products (say 3 > products) to make. Each product may need variable amount of > time to make. > Say first product needs 1-3 days, second needs 1-5 days and the third > product need 1-7 days. It is not necessary to make all three > products in the > time period. It is ok if by the end of the given time period > (10 days), a > product is not finished. I need to compute the number of all > potential > schedules of making the combination of the three products and make a > schedule table like this: interesting homework assignment DATA TABLE; do K = 1 to 2; do T = 1 to 10; do P = 1 to 2; do D = 1 to 3; output; end; %*do P; end; %*do T; end; %*do K; end; stop; proc PRINT; RUN; Ron Fehd the macro maven CDC Atlanta GA USA RJF2@cdc.gov OpSys: WinNT Ver: 8.1 ---> cheerful provider of UNTESTED SAS code!*! <--- If you always try to be logical, you probably won't ever have much sorrow, or much fun. -- Ashleigh Brilliant pot-shot #4438 > ScheduleId(k) TimePeriod(t) Product(p) Day(d) > 1 1 1 1 > 1 2 1 2 > 1 3 1 3 > 1 4 1 1 > 1 5 1 2 > 1 6 1 1 > 1 7 2 1 > 1 8 2 2 > 1 9 2 3 > 1 10 2 4 > 2 1 2 1 > 2 2 2 2 > 2 3 2 3 > 2 4 2 4 > 2 5 2 5 > 2 6 3 1 > 2 7 3 2 > 2 8 3 3 > 2 9 3 4 > 2 10 3 5 > > > Can anyone help me with this? > ```

Back to: Top of message | Previous page | Main SAS-L page