Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Mastering Enterprise Javabeans
Mastering Enterprise Javabeans
Hi-index | 0.00 |
Scheduling and Production Planning problems are typically large in scale and fairly complex. A decision support system for such an operations research (OR) problem makes a good case study to be implemented using the web enabled, enterprise scale facilities of Java 2 Enterprise Edition (J2EE) and Simple Object Access Protocol (SOAP). We propose mathematical programming models as well as design and analyze certain specialized algorithms for special versions of these problems. In general, we use a powerful grade Mixed Integer Programming (MIP) solver, which we have web-enabled in our distributed decision support system, to solve the MIP models created by our system. Reusing web infrastructure can drastically lower the cost of setting up these application and allows us to reuse all kinds of tools originally built for the web.