Joy precedes competition.

Game && Jaguareins

Assembly-Line-Scheduling problem solution(CLRS)

with one comment

These days I’m spending a lot of time with the book Introduction To Algorithms – CLRS. Few hours back I implemented an example of Dynamic Programming. The problem is known as Assembly Line Scheduling. I’ve used 2 functions to implement, one for doing all the processing of input named fastest-way() while the other one is to display order of stations, named print-stations(). I will be re-writing the print-stations() function using recursion. (As the book has asked in the exercise following this problem.)
Input format:
n
e1 e2
x1 x2
a1
t1
a2
t2

Here is the code.

Compiler g++ 4.3.2
OS Ubuntu 8.10
Editor – vim

Advertisements

Written by LaFolle

March 27, 2009 at 18:58

Posted in Uncategorized

One Response

Subscribe to comments with RSS.

  1. can you plz check the pgm is givin error in urbo c
    its sayin constant expression reqd…
    plz mail me the turboc version
    nutan.julka@yahoo.co.in
    thx

    nutan

    October 6, 2009 at 13:25


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: