GMU OR 680/SE 798

18 Mar 2009

Newspaper Production Process

8

The objective of the algorithm is to identify the minimum cost
path through the network (in terms of change-over time)

1

IPC 2

IPC 3

IPC 4

IPC 5

IPC 6

IPC 7

IPC 8

IPC 9

IPC 10

IPC N

IPC 1

IPC 2

IPC 3

IPC 4

IPC 5

IPC 6

IPC 7

IPC 8

IPC 9

IPC 10

IPC N

IPC 1

IPC 2

IPC 3

IPC 4

IPC 5

IPC 6

IPC 7

IPC 8

IPC 9

IPC 10

IPC N

IPC 1

IPC 2

IPC 3

IPC 4

IPC 5

IPC 6

IPC 7

IPC 8

IPC 9

IPC 10

IPC N

IPC 1

IPC 2

IPC 3

IPC 4

IPC 5

IPC 6

IPC 7

IPC 8

IPC 9

IPC 10

IPC N

IPC 1

IPC 2

IPC 3

IPC 4

IPC 5

IPC 6

IPC 7

IPC 8

IPC 9

IPC 10

IPC N

IPC 1

IPC 2

IPC 3

IPC 4

IPC 5

IPC 6

IPC 7

IPC 8

IPC 9

IPC 10

IPC N

IPC 1

IPC 2

IPC 3

IPC 4

IPC 5

IPC 6

IPC 7

IPC 8

IPC 9

IPC 10

IPC N

IPC 1

IPC 2

IPC 3

IPC 4

IPC 5

IPC 6

IPC 7

IPC 8

IPC 9

IPC 10

IPC N

IPC 1

IPC 2

IPC 3

IPC 4

IPC 5

IPC 6

IPC 7

IPC 8

IPC 9

IPC 10

IPC N

Identify minimum cost
schedule

Assumptions

§An
IPC is defined by an index, a production
quantity, an FSI vector (FSI[]),
and an FSI page count vector identifying
the number of FSIs at various page
counts FSI_pageCount[]

–Example: IPC X:

[1; 35,000; FSI[0,0,1,0…];

FSI_pageCount [10,6,…]

[1; 35,000; FSI[0,0,1,0…];

FSI_pageCount [10,6,…]

§The
cost function associated with each edge
(cij) is a function of the number and type of hopper change-overs required to reconfigure the collator from the current IPC to the new IPC

–No cost is associated
with open hopper loading time
(e.g., if there is an open
hopper available on the collator)

–New hopper assignments
will be assigned based on some
rule (e.g., largest
first, smallest first, random)

IPC