Bin Packing Problem

Hello all,
Can you please help me out a little bit on bin packing problem?
I have a jpanel and i want to divide its space in order to put rectangles but having in mind that i have to take advantage of all the empty space provided by the jpanel
thnx,
John

Maybe you mean 2-dimensional bin packing?
An example bin packing problem is this:
Jill has 42 files (of various sizes) that she needs to copy to another computer. She wants to use floppies (which hold 1.44 Mb of data). What is the minimum number of floppies required AND what combinations of files would be saved onto each of those floppies?
As an extension, a 2d bin packing problem incorporates a notion of area into the calculation.
(note that both problems are NP complete).
Here is a commercial company that specializes in this (found with Google, 2d bin packing algorithm):
http://www.astrokettle.com/

Similar Messages

Java Bin-packing problem

Hi all,
I have a evolutionary algorithm that I want to try and solve, but it's hard getting started and knowing where to start exactly. Here is the description below, it would be great if anyone could give me a few tips on how to go about it:
"The bin-packing problem involves 'n' items, each with its own weight (there are 500 items in fact, and the weight of each is 4 times its item number).
Each item must be placed in one of 'b' bins (there are 10 bins). The task is to find a way of placing the items into the bins in such a way as to make the total weight in each bin as equal as possible.
A chromosome (solution to the problem) is represented as a list of 'n' numbers (500 numbers), where each number can be anything in the range from 1 to b.
Basically, if the 1st number in the chromosome is 4, then this means item number 1 is in bin 4. "
I obviously don't expect anyone to give me code to this, but it would be a great help if someone could assist me in how to get going (i.e. what classes to have and what variables they would take).
thanks

Ok then, thanks for that. This is how I picture it so far, a possible way of doing this:
You would have an Item array, of 500 items, each with their own number (1-500) and each with their own weight (4 * their item number).
Then there would be a Chromosome array, which would be an array of Items (500 of them). Each of these would be put into a random bin (from 1 - 10), and calculations would be made so that the bins' weights would be cumulative.
Then there is a Population array, which is an array of random Chromosomes, that would all have their own fitness function worked out (in this case, fitness function is equal to the heaviest bin - the lightest bin).
What does everyone think? Please correct me if this is not on the right lines. As I said, i'm a java n00b.
thanks

Optimal bin packing problem

I have a homework assignment that I'm really stuck on. I'm not looking for code (I'm sure I could find that if I wanted, but I really want to UNDERSTAND this).
I need to make a recursive method to find the OPTIMAL solution (least number of bins used).
The professor basically gave us an algorithm to use, but it confuses the heck out of me. I seriously think I could do this other ways, but I don't think we are allowed.
Here is what was given to us (I'll post my couple of questions below):
If there are no items left, there is nothing left to pack; return the current set of bins(base case).
For the recursive case:
1) Make a (deep) copy of the list of items, and remove one item from it.
2) For every bin, make a (deep copy) of the entire set of bins, and place the item in that bin. If the item fits, recursively apply the algorithm with the same number of bins, the modified list of items (the copy made above), and the copied set of bins with the item added.
3) Do the same thing as (2) except place the item in a new (previously empty) bin in the copied set.
4) Pick the best result from steps (2) and (3) (the one with the fewest bins) and return it.
OK, the part I don't get is the "for every bin, make a (deep) copy of the entire set of bins". ---If the first item tested (in the first copied set of bins) fits, the algorithm is recursed.. So I don't really grasp how it would actually test the item in every other bin. I know I must be missing something here, but I've spent at least 15 hours on this and have gotten virtually nowhere on this portion of the assignment.
This is obviously supposed to be an exhaustive search, since being an NP problem that would be the only way to attain an optimal solution. I tried coding what I thought was meant by this above pseudo-algorithm, but without testing every bin, i only ended up with a first-fit result.
If someone could give me a bit of insight into what is meant by the line "for every bin, make a (deep) copy of the entire set of bins", and how it could possibly be applied so that the recursion doesn't just happen before the item is placed into following bins it would be greatly appreciated.
I don't want to post any code here because I don't want it to look like another "do my homework" post, but if someone wants to see where I'm at, I can do so. Also, before anyone says I should just ask the professor or whatever, he is Chinese with a REALLY strong accent, and so are all the assistants (really...), and I can't understand a word they say. So although I'm attending all lectures, I'm still basically teaching myself. :P

in step 4 he asks you to return the best result obtained in steps 2 or 3.
Yes, in step 2, if it fits in the first bin you will trigger a recursion, BUT you simply remember the result of that optimal fit (counting how many bins it took) and go on to try the next slot.
If there were N bins when you started, you wil be making potentially N recursive calls in step 2 (though you will remember the results of only one of those), you will then make one more recursive call in step 3, and you will return one single result - namely the set of bins that took the fewest total count from those N+1 trials.

Bin packing

hi,
I've got to implement a problem that is exactly the bin packing problem. Googling around found this
http://mathworld.wolfram.com/Bin-PackingProblem.html
which says
An alternative strategy first orders the items from largest to >smallest, then places them sequentially in the first bin in which they >fit. In 1973, D. Johnson showed that this strategy is never suboptimal >by more than 22%, and furthermore that no efficient bin-packing >algorithm can be guaranteed to do better than 22% (Hoffman 1998, p. >172). which sounds great, but was wondering if anyone knows anything about whether genetic algorithms might be better (there are quite a few papers about this but skim reading them hasn't thrown up hard figures for performance).
This looks good too
http://www.aridolan.com/ga/gaa/Binpack5_19.html
but there aren't any figures for performance either?
just thought someone might be able to save me some serious reading time :)
thanks,
asjf

no efficient bin-packing algorithm can be guaranteed to do better than 22% Right, an exaustive search will give you an optimal solution. Genetic algorithms are just a another search through a solution space.
The site seems down right now but you may want to check out (possibly port)
http://linpacker.tuxfamily.org/

Bin Packing algorithum

Hello Friends,
Please help me out ..
I want to generate the code like bin packing algorithm in pl sql ..
So is there any utility or algorithm exits in oracle that is similar to bin packaging algorithm...
Thanks

As Hoek mentioned, there is no built in utility for bin packing in Oracle, because there is no generic rule for it. All it depends upon different business rule and approaches. If you write the question in PL/SQL forum by providing Oracle Version, Create Table and insert statement, Logic behind required output in simple English language; then I am sure you can also get the answer as I https://forums.oracle.com/thread/2612134
Regards
Girish Sharma

War packing problems

Hi, everyone. I've got a problem with packing my application into a war file.
I am running on the Java System Application Server 9.1_01 and use the Java EE 5 SDK.
There is no problem with the deployment descriptors nor with the folder structure.
When deploying my application packed with netBeans, everything's fine.
But when i try to pack it manually and deploy it using the admin console, the server throws an internal error.
So, I assume that the problem is with packing.
I am using the following command when packing:
jdkroot\bin> jar cvf warname.war d:\applicationFolder
1) How to pack it correctly?
2) Should all the classes in the classes dir be compiled before packing? (I assume yes).
Can anyone help?
Thank you.

Here's the error taken from the server log.
[#|2008-01-25T10:56:45.859+0200|SEVERE|sun-appserver9.1|javax.enterprise.system.tools.deployment|_ThreadID=14;_ThreadName=Thread-25;_RequestID=f4385037-85ec-4f85-9c5c-b3a0aa8b5323;|Could not expand entry d:\webapplication4\build.xml into destination D:\JavaEE5SDK\domains\domain1\applications\j2ee-modules\netwar
java.io.IOException: Error expanding archive C:\Documents and Settings\Administrator\Local Settings\Temp\netwar50885.war; please see the server log file for more information
     at com.sun.enterprise.deployment.backend.J2EEModuleExploder.explodeJar(J2EEModuleExploder.java:359)
     at com.sun.enterprise.deployment.backend.WebModuleDeployer.preDeploy(WebModuleDeployer.java:131)
     at com.sun.enterprise.deployment.backend.ModuleDeployer.doRequestFinish(ModuleDeployer.java:171)
     at com.sun.enterprise.deployment.phasing.J2EECPhase.runPhase(J2EECPhase.java:191)
     at com.sun.enterprise.deployment.phasing.DeploymentPhase.executePhase(DeploymentPhase.java:108)
     at com.sun.enterprise.deployment.phasing.PEDeploymentService.executePhases(PEDeploymentService.java:919)
     at com.sun.enterprise.deployment.phasing.PEDeploymentService.deploy(PEDeploymentService.java:279)
     at com.sun.enterprise.deployment.phasing.PEDeploymentService.deploy(PEDeploymentService.java:788)
     at com.sun.enterprise.management.deploy.DeployThread.deploy(DeployThread.java:187)
     at com.sun.enterprise.management.deploy.DeployThread.run(DeployThread.java:223)
Caused by: java.io.IOException
     at com.sun.enterprise.util.io.FileUtils.openFileOutputStream(FileUtils.java:750)
     at com.sun.enterprise.deployment.backend.J2EEModuleExploder.explodeJar(J2EEModuleExploder.java:331)
     ... 9 more
Caused by: java.io.FileNotFoundException: D:\JavaEE5SDK\domains\domain1\applications\j2ee-modules\netwar\d:\webapplication4\build.xml (The filename, directory name, or volume label syntax is incorrect)
     at java.io.FileOutputStream.open(Native Method)
     at java.io.FileOutputStream.<init>(FileOutputStream.java:179)
     at java.io.FileOutputStream.<init>(FileOutputStream.java:131)
     at com.sun.enterprise.util.io.FileUtils$FileOutputStreamWork.run(FileUtils.java:1613)
     at com.sun.enterprise.util.io.FileUtils.doWithRetry(FileUtils.java:788)
     at com.sun.enterprise.util.io.FileUtils.openFileOutputStream(FileUtils.java:743)
     ... 10 more
|#]
[#|2008-01-25T10:56:45.906+0200|SEVERE|sun-appserver9.1|javax.enterprise.system.tools.deployment|_ThreadID=14;_ThreadName=Thread-25;_RequestID=f4385037-85ec-4f85-9c5c-b3a0aa8b5323;|Exception occured in J2EEC Phase
com.sun.enterprise.deployment.backend.IASDeploymentException: Error expanding archive C:\Documents and Settings\Administrator\Local Settings\Temp\netwar50885.war; please see the server log file for more information
     at com.sun.enterprise.deployment.backend.J2EEModuleExploder.explodeJar(J2EEModuleExploder.java:359)
     at com.sun.enterprise.deployment.backend.WebModuleDeployer.preDeploy(WebModuleDeployer.java:131)
     at com.sun.enterprise.deployment.backend.ModuleDeployer.doRequestFinish(ModuleDeployer.java:171)
     at com.sun.enterprise.deployment.phasing.J2EECPhase.runPhase(J2EECPhase.java:191)
     at com.sun.enterprise.deployment.phasing.DeploymentPhase.executePhase(DeploymentPhase.java:108)
     at com.sun.enterprise.deployment.phasing.PEDeploymentService.executePhases(PEDeploymentService.java:919)
     at com.sun.enterprise.deployment.phasing.PEDeploymentService.deploy(PEDeploymentService.java:279)
     at com.sun.enterprise.deployment.phasing.PEDeploymentService.deploy(PEDeploymentService.java:788)
     at com.sun.enterprise.management.deploy.DeployThread.deploy(DeployThread.java:187)
     at com.sun.enterprise.management.deploy.DeployThread.run(DeployThread.java:223)

Delivery rescheduled during packing - problem

We have a process where we invoice packaging material. When we create the handling unit in the delivery packing, and use material with the relevant item category assignment, an item in the delivery is created.
The problem is that at the same time, the delivery is rescheduled. As we have set up pick/pack time = 1 or 2 shifts in shipping point dependent on route, and the packing is done as the last step before goods issue, the goods issue date shifts 1 u2013 2 days into the future.
As we are in a common system and client with other countries, and the shipping and scheduling process is handled differently, the delivery type is set up with scheduling active. On delivery create we override the parameter with user exit MOVE_FIELD_TO_LIPS. (In our process we want to keep the schedule coming from the sales order in the delivery).
Apparently this user exit is not active when items are added from packing.
I have searched all documentation I can find, as well as this forum and the Wiki. So far I have found no reference.
Any tip of how we can solve this, would be appreciated.
System is 4.6C
Brgds & thanks up front
Lars Aam

Thanks a lot. I searched OSS notes, but did not find this one. (I guess I need to learn more about finding OSS).
It had a reference to note 350462. This says it stops the rescheduling for item type = C. Item type C are items added from packing. So to me it this looks to meet our requirement.
there is the issue that if packing materials are stock managed, you can get problems in MRP. So we might need to develop something that take care of that, in case somebody running on our system want to have packing materials managed in stock. The developers have told me, that they don't find any user exit to manage this.
I can keep you posted on what solution we end up with, if you are interested.
Brgds
Lars Aam

Extraction Pack Problem in Integration of DataStage 7.5.1 with BI 7.0

Hi,
I am facing problem in loading data using DataStage Extraction Pack. I am using DataStage version 7.5.1A and BW pack 4.2.1. The Load Pack is working fine.
In Extraction Pack properties, The InfoSpoke "xxxxxxxx" is appearing in the search, while trying to select the InfoSpoke the system is showing 'The InfoSpoke "xxxxxxxx" was not found'.
Can you please help me in over coming the issue. Any input is much appreciated.
Thanks in advance,
Kindest Regards
Surya.

Hello,
But the problem is that when I close the terminal all connection are lost and given error "The requested URL could not be retrieved" That's not very surprising, as APEX Listener is running in Standalone Mode in your current scenario. If you close the terminal session that the JVM is running in you kill the JVM and hence APEX Listener.
You could use a tool like "nohup" to detach the process you start from your terminal session. But using the Standalone Mode for a (long running) production scenario is not recommended anyway, and...
I want to configure listener with EBS .When I start instance automatic start apex listener... obviously not your actual aim.
So, EBS shall be your target. Shoudn't be a huge problem, as EBS comes with an OC4J Container and OC4J is one of the Containers officially supported by APEX Listener. I'm not sure if your EBS already ships with the JDK version needed, but as soon as it runs at least 1.6.0_20 it should work.
As I've already replied to your question in {thread:id=1118604} there is a working approach described in {message:id=10069317}.
Did you try that one? If so and it didn't work out, could you please describe the problems you've encountered?
Thanks,
Udo

Packing problem for parts

Hi Friend
I have a ticket which goes as below .
Part substitution for service parts.
Order is for 20pc of 195.S and 23pc of 145.S
195.S consumes part 195.F
145.S consumes part 195.F (part substitution)
We created delivery 80005617.
We pack the pallets. In the pack proposal tab, we pack each part one at a time using the _SP packing instructions.
When we packed the 195.S, the 145.S were packed together.
We did not do ?automatic? packing, the ?red and white? button. WE PACKED EACH PART SEPARATELY.
When we clicked on the 195.s to pack, the 145.s automatically packed together.
Therefore the parts were combined. See the labels that are attached.
The label printed:
145.S 13pc
195.S 30pc
Wrong quantities for each part.
But both line items consume same material . Line Item 1 is 195.F and line item 2 is 145.S , but line item 2 also consume 195.F only due to material substitution .
How can solve this problem , Could any one help me out on this issue as I new to this topic
But in the label, wrong quantity printed . when checked the print program there is no error found .it is a master label .
If I want to check packing instruction where I have check .
Could I request you to mention path in SPRO and T code to check packing instruction? .
As both line items uses same materials , have they got clubbed together while packing ?
Thanks In advance

Hi,
Packing instruction is master data in SAP. Using transaction POP3 you can check it.
(SAP easy access menu > Logistics > Central Functions > HUM > Master Data > Packaging Instructions)
Regards,
Csaba

Packing problem in STO

Hello All,
The problem is related to Packing process in case of Stock Transfer Order (STO).After making delivery while doing the packing procedure, in " Handling Unit " supplements 'Handling Unit Group 1' field is not getting populated automatically (under additional data tab) though all the master data against 'Handling Unit Group 1' are maintained.
Please suggest regarding what are the configurations missing.
Thanks & Regards
Priyanka Mitra

Hi,
As per my earlier posts I have already maintained all the master data against 'Handling Unit Group 1' for example 00001 to 00500 and the combination of finished good & packing material in the packaging instruction in POP2 are also maintained.
Please note that in another scenario the handling unit is getting automatically populated in the packing process after delivery where also the above mentioned areas are not maintained, but still it is working properly.
The steps I have configured and which is also followed in the working scenario are as follows -
In outbound delivery change mode (T Code - VL02N) go to Pack -> Click on Pack Proposal -> Expand packing instruction -> select 602 -> Create HUs -> Message shown is Handling Units were created -> click on Pack material & select the 'Handling Unit' line -> then select 'Detailed view general' -> then go to Additional Data where in Handling Unit Group 1, value is automatically populated / assigned for example 00027.
In my process only the value for example 00001against each respective HUs are not getting automatically populated/ assigned. How to do this ? please suggest if I am missing any steps while configuration.
Thanks & Regards
Priyanka

Slow pack() problem; is there a workaround? (was 'Odd delay on first pack()

I've run into a rather perplexing problem with pack(). When I pack() a visible frame after re-sizing a panel within it, pack takes over FIVE seconds, compared to one second to create the gui in the first place, including a pack(). Subsequent resize-repack calls are very fast. Here's a test program that illustrates the problem:
import javax.swing.*;
import java.awt.event.*;
import java.awt.*;
public class Test implements ActionListener {
    boolean isOpen;
    Dimension prefD;
    JFrame f;
    JPanel pan1;
    long tm; /* All times in milliseconds. */
    public Test() {
        elapsedTime();
        f = new JFrame();
            // The main panel
        JPanel pan = new JPanel();
        pan.setLayout(new BoxLayout(pan,BoxLayout.Y_AXIS));
        f.getContentPane().add(pan);
            // Add the button in a panel
        JButton b = new JButton("b");
        b.addActionListener(this);
        pan.add(b);
            // Add a label in another panel
        pan1 = new JPanel();
        pan1.setLayout(new BoxLayout(pan1,BoxLayout.Y_AXIS));
        pan.add(pan1);
        pan1.add(new JLabel("This is pan 1"));
        isOpen = true;
        f.pack();
        prefD = new Dimension(pan1.getPreferredSize()); // Save this size
        f.setVisible(true);
        System.out.println("Time elapsed in initially creating the gui: "
                           + elapsedTime());
    public void actionPerformed(ActionEvent e) {
        if ( isOpen ) { // Hide the second panel
            elapsedTime();
            pan1.setPreferredSize(new Dimension(prefD.width,0));
            pan1.setSize(new Dimension(prefD.width,0));
            System.out.println("Time to resize the panel: " + elapsedTime());
            f.pack();
            System.out.println("Time to pack(): " + elapsedTime());
            isOpen = false;
        else { // Show the lower panel
            elapsedTime();
            pan1.setSize(prefD);
            pan1.setPreferredSize(prefD);
            System.out.println("Time to resize the panel: " + elapsedTime());
            f.pack();
            System.out.println("Time to pack(): " + elapsedTime());
            isOpen = true;
    long elapsedTime() {
        long cur = System.currentTimeMillis();
        long elapsed = cur - tm;
        tm = cur;
        return(elapsed);
    public static void main(String[] argv) {
        new Test();
}When I run this test, the times from hitting the button six times are:
Time elapsed in initially creating the gui: 1260
Time to resize the panel: 0
Time to pack(): 5004
Time to resize the panel: 0
Time to pack(): 3
Time to resize the panel: 1
Time to pack(): 3
Time to resize the panel: 0
Time to pack(): 3
Time to resize the panel: 0
Time to pack(): 3
Time to resize the panel: 0
Time to pack(): 3If I set the frame invisible before the pack and visible again after, the time delay disappears, but of course this is not an adequate solution.
I'd appreciate an suggestion for a workaround, or any ideas about what the problem is. I'm pretty much stuck.
Thanks,
bw

OS: Linux, SuSE 8.0, kernel 2.4.18-4GB
JDK: I've tried this with two versions of 1.4.1
java version "1.4.1"
Java(TM) 2 Runtime Environment, Standard Edition (build 1.4.1-b21)
Java HotSpot(TM) Client VM (build 1.4.1-b21, mixed mode)
and
java version "1.4.1"
Java(TM) 2 Runtime Environment, Standard Edition (build Blackdown-1.4.1-beta)
Java HotSpot(TM) Client VM (build Blackdown-1.4.1-beta, mixed mode)
moi@bearblue:/usr/local
These yield the same problem (of course they are closely related).
It turns out that the problem does NOT occur with an old 1.3.1 version:
java version "1.3.1"
Java(TM) 2 Runtime Environment, Standard Edition (build 1.3.1)
Classic VM (build 1.3.1, J2RE 1.3.1 IBM build cxia32131-20020410 (JIT enabled: jitc))

SAP_HR Support Pack Problem

Hello,
I am trying to apply the year-end support packs for SAP_HR (SAPKE50023 - SAPKE50026). I get so far with SPAM, but then I get the following error: Error in phase: IMPORT_PROPER, Reason for error: TP_STEP_FAILURE. I applied the latest TP version just in case that was the problem, but it did not solve it. Any ideas?
Thank you for your time,
Erin Byrne

Hi Ruchit,
In SPAM, it says the following:
Error in phase: IMPORT_PROPER
Reason for error: TP_STEP_FAILURE
Return code: 0012
Error message: OCS Package ALL, tp step "N", return code 0012
I looked at the system log, but there was not anything new there. In /usr/sap/trans/log, I looked at my N log, & it basically said CONVERSION OF DD OBJECTS (TBATG) ended in return code 0012. It was not very helpful. I applied TP version 145 (the latest one I found), but that did not help the issue. When I look in STMS, there are no errors in the setup either. Any help you can offer would be much appreciated.
Thank you,
Erin

Automatic Bin Determination Problem

Dear Experts
Hope all of you doing well.
I am Facing Problem with T.Code LT04 ( Below are the Senario)
At the time of Post LT04 Transaction system not picking Source Storage Bin Automatically
"Error Message : System cannot find source Storage Bin"
Material Master Maintained with Storage Bin
And at Intial screen of LT04 there is not option for F4 ( in storage Bin coloum )
For that reason user every time has to put Storage Bin No Manually
Is there are any option available in customization that system automatically detremined Storage bin
Please help me in this regards
With Best Regards
Suman

So, You should also have maintained fixed bin in WM2 view.
Now, check whether RK1 has Storage section check active? If yes, what is the section given in search OMLZ?
check whether same section is given in that fixed bin. Now only concentrate on your fixed bin. forget about other 50 bins.
Hi
Thanks for your Reply
Yes fixed bin has been maintained in MW2 View
Storage section check is not active for RK1
( If I want to make it ticked ( Storage section check active) now system give the error message like " If you have st.pl.str. "Fixed bin", the area check must not be active" )
In OMLY transaction under its maintained as under
CWH     RK1     001          0     F01     S01     T01
CWH     RK1     002          0     T01     S01     F01
CWH     RK1     F01          0     F01     S01     T01
CWH     RK1     S01          0     F01     S01     T01
CWH     RK1     T01          0     T01     S01     F01
( WHNO-CWH , STOG.TY-RK1 , FAST MOVING - 001 , F01-Rack Fast-moving for CWH , S01-Rack Slow-moving for CWH , T01-Rack Total Sec for CWH
Please suggest
Regards
Suman

/usr/bin/diff problem

Hi,
we just migrated one of our apps from Solaris 8 to Solaris 10.
One issue we noticed is the following:
Once a day an RCS-controlled ASCII text configuration database is being updated. This file has a size of about 260 MB.
As per normal RCS procedure, before the new file is checked in, it's being compared to the old version using /usr/bin/diff.
On the old Server (Netra T4, Solaris 8) the diff was running for about 15 Minutes.
On the new Server (V245, Solaris 10) the diff now takes 2 1/2 hours !!
I haven't found an obvious cause for this, so I was thinking about using dtrace to find out why the diff on the new server is taking that long.
On the other side, I don't have much experience with dtrace yet....
I would very much appreciate any help you could offer to help me find the problem.
thanks
--Marc

In the future, you might consider asking Unix and Terminal oriented questions in the Mac OS X Technologies > Unix Forum
<http://discussions.apple.com/forum.jspa?forumID=735>

Performance Pack problem under win2k

i am running wls 5.1sp5 under win2k.
and get always the same errormessage at startup:
<Posix Performance Pack> Could not initialize POSIX Performance Pack.
<Performance Packnc> Unable to load performance pack using java I/O
what am i doing wrong ??

Yes, this is a known problem that we discovered recently.
Contact [email protected] or wait until next service pack goes out.
Kumar
Todd Carmichael wrote:
I also am getting the same error messages on Win2k, though I do not get the
POSIX error. Is the performance pack not needed on Windows 2k
Tue Aug 29 18:04:56 PDT 2000:<E> <Performance Pack> Unable to load
performance pack, using Java I/O.
"Johannes Plachy" <[email protected]> wrote in message
news:[email protected]..
i am running wls 5.1sp5 under win2k.
and get always the same errormessage at startup:
<Posix Performance Pack> Could not initialize POSIX Performance Pack.
<Performance Packnc> Unable to load performance pack using java I/O
what am i doing wrong ??

Bin Packing Problem

Similar Messages

Maybe you are looking for