• Create BookmarkCreate Bookmark
  • Create Note or TagCreate Note or Tag
  • PrintPrint
Share this Page URL
Help

19. Some Common Data Manipulation Proble... > 19.7. Time to Completion III—A MaxMi...

Time to Completion III—A MaxMin Problem

Let’s make the time-to-completion problem even more involved. Suppose each module is composed of several parts. Periodically, the workers involved with a particular part will make an entry into a database table, as shown in Table 19-10.

Table 19-10. Widgets table: Time to completion of a widget whose modules consist of multiple parts

WidgetID

ModuleID

PartID

TimeToCompletion

1

1

1

3

1

1

1

4

1

1

1

5

1

1

2

2

1

1

2

4

1

1

2

1

1

2

1

6

1

2

1

5

1

2

1

3

1

2

2

7

1

2

2

4

1

2

2

3

1

2

3

4

1

2

3

5

1

2

3

6

1

3

1

8

1

3

1

5

1

3

2

2

1

3

2

4

We want to compute the time to completion for each part, module, and widget. Note that there may be several entries for a given part. The time to complete a given part is the minimum of the times in these rows.


PREVIEW

                                                                          

Not a subscriber?

Start A Free Trial


  
  • Creative Edge
  • Create BookmarkCreate Bookmark
  • Create Note or TagCreate Note or Tag
  • PrintPrint