[Search for users]
[Overall Top Noters]
[List of all Conferences]
[Download this site]
| Title: | Mathematics at DEC |
|
| Moderator: | RUSURE::EDP |
|
| Created: | Mon Feb 03 1986 |
| Last Modified: | Fri Jun 06 1997 |
| Last Successful Update: | Fri Jun 06 1997 |
| Number of topics: | 2083 |
| Total number of notes: | 14613 |
1197.0. "Packing Problem" by DOAR::TURNER (MALLET::TURNER or DTN 768-5411) Mon Feb 26 1990 09:18
[also posted in Algorithms Notesfile]
A record company has just recorded some songs which they want to lay out
on some two-sided medium (e.g. record, cassette). Their goal to balance
the songs so that the total playing time of each of the two sides is as
equal as possible. Getting an equal number of songs on each side is not
a goal.
Given the list of playing times for each song, what's the most efficient
way to lay out each side and satisfy the goal of balanced total playing
times? Assume real-valued playing time for each song and no delay between
songs.
With two-sided media, this seems like a variation of the knapsack problem,
but does the task of allocating songs between the two sides make it more
complex? What happens as the number of sides increases from 2 to n?
| T.R | Title | User | Personal
Name | Date | Lines |
|---|
| 1197.1 | Packing songs on a record | 4GL::GILBERT | Ownership Obligates | Mon Feb 26 1990 10:19 | 1 |
| See note 541.
|