Cooperative Multiobjective Decision Support for the Paper Industry

References

• Abdul-Razaq T. S., Potts C. N., Van Wassenhove L. N. A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Appl. Math. (1990) 26(3):235–253Crossref, Google Scholar
• Akkiraju R., Keskinocak P., Murthy S., Wu F. An agent-based approach for multi-machine scheduling. (1998) 27–29Proc. 10th Annual Conf. Innovative Appl. Artificial IntelligenceMenlo Park, California:1013–1019JulyGoogle Scholar
• Beck J. C., Fox M. S. Supply chain coordination via mediated constraint relaxation. (1994) 15Proc. First Canadian Workshop Distributed Artificial IntelligenceBanff, Alberta(MayGoogle Scholar
• Beck K., DeKing N., Garcia D., Goldsmith P., Keaton D., Marshall C., McLaren J., Miller D., Page R., Routson J., Rowland J., Rudder G., Tsai K., Whittingham T.Pulp and Paper 1998 North American Fact Book(Miller Freeman Inc, San Fransico, California) Google Scholar
• Bennett D. P. Multicriteria optimization. (1998) . http://www.ieor.berkeley.edu/~bennett/multicrit.htmlGoogle Scholar
• Biermann C.Essentials of Pulping and Papermaking (1993) (SanDiego Academic Press, San Diego, California) Google Scholar
• Chen C. L. Bayesian nets and A-teams for power system fault diagnosis. (1992) (Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania) . PhD thesisGoogle Scholar
• Das I. Multi-objective optimization. (1998) . http://www.mcs.anl.gov/otc/Guide/OptWeb/multiobj/index.htmlGoogle Scholar
• deSouza P. S. Asynchronous organizations for multi-algorithm problems. (1993) (Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania) . PhD thesisGoogle Scholar
• Du J., Leung J. Y. Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. (1990) 15(3):483–494Link, Google Scholar
• Dyckhoff H. A typology of cutting and packing problems. Eur. J. Oper. Res. (1990) 44(2):145–159Crossref, Google Scholar
• Erman L. D., Hayes-Roth F., Lesser V. R., Reddy R. D. The Hearsay-II speech-understanding system: Integrating knowledge to resolve uncertainty. ACM Comput. Surveys (1980) 12(2):213–253Crossref, Google Scholar
• Ferreira J. S., Neves M. A., Castro P. F. A two-phase roll cutting problem. Eur. J. Oper. Res. (1990) 44(2):185–196Crossref, Google Scholar
• Gilmore P. C., Gomory R. E. A linear programming approach to the cutting stock problem. Oper. Res. (1961) 9(6):849–859Link, Google Scholar
• Gilmore P. C., Gomory R. E. A linear programming approach to the cutting stock problem: Part II. Oper. Res. (1963) 11(6):863–888Link, Google Scholar
• Golden B. L. Approaches to the cutting stock problem. AIIE Trans. (1976) 8(2):265–273Crossref, Google Scholar
• Goodwin R. T., Rachlin J., Murthy S., Akkiraju R. Interactive decision support: Advantages of an incomplete utility model. (1998) Proc. AAA1 Spring Sympos. Interactive and Mixed Initiative Decision-Theoretic SystemsStanford, California:55–61March 1998Google Scholar
• Goulimis C. Optimal solutions for the cutting stock problem. Eur. J. Oper. Res. (1990) 44(2):197–208Crossref, Google Scholar
• Haessler R. W. A heuristic programming solution to a nonlinear cutting stock problem. Management Sci. (1971) 17(12):793–802Link, Google Scholar
• Haessler R. W. Selection and design of heuristic procedures for solving roll trim problems. Management Sci. (1988a) 34(12):1460–1471Link, Google Scholar
• Haessler R. W. A new generation of paper machine trim programs. Tappi J. (1988b) 71(8):127–130Google Scholar
• Haessler R. W., Sweeney P. E. Cutting stock problems and solution procedures. Eur. J. Oper. Res. (1991) 54(2):141–150Crossref, Google Scholar
• Hinxman A. I. The trim-loss and assortment problems: A survey. Eur. J. Oper. Res. (1979) 5(1):8–18Crossref, Google Scholar
• Ho J. C., Chang Y. Heuristics for minimizing mean tardiness for m parallel machines. Naval Res. Logist. (1991) 38(3):367–381Crossref, Google Scholar
• Hoffman T. AI based software models help cut production costs. Computer World (1996) September 2):59–60 http://www.computerworld.com/home/print9497.nsf/all/SL35paperGoogle Scholar
• Holland J. H.Adaptation in Natural and Artificial Systems (1975) (University of Michigan Press, Ann Arbor, Michigan) Google Scholar
• Holsenback J. E., Russell R. M. A heuristic algorithm for sequencing on one machine to minimize total tardiness. J. Oper. Res. Soc. (1992) 43(1):53–62Crossref, Google Scholar
• Huberman B., Lukose R., Hogg T. An economics approach to hard computational problems. Science (1997) 275(5296):51–54Crossref, Google Scholar
• Keskinocak P., Wu F., Goodwin R. T., Murthy S., Akkiraju R., Kumaran S., Derebail A. Scheduling solutions for the paper industry. (1998) . IBM research report RC21297 (94999)Google Scholar
• Koulamas C. The total tardiness problem: Review and extensions. Oper. Res. (1994) 42(6):1025–1041Link, Google Scholar
• Lee H. S., Murthy S., Haider S. W., Morse D. Primary production scheduling at steel-making industries. IBM J. Res. Development (1996) 40(2):231–252Crossref, Google Scholar
• Lee Y. H., Bhaskaran K., Pinedo M. A heuristic to minimize the total weighted tardiness with sequence dependent setups. IIE Trans. (1997) 29(1):45–52Crossref, Google Scholar
• Lee Y. H., Pinedo M. Scheduling jobs on parallel machines with sequence dependent setup times. Eur. J. Oper. Res. (1997) 100(3):464–474Crossref, Google Scholar
• Liu J. S., Sycara K. P. Multiagent coordination in tightly coupled task scheduling. (1996) Proc. 2nd Internat. Conf. Multiagent Systems (ICMAS '96)Kyoto, JapanDecemberGoogle Scholar
• Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementations (1990) (John Wiley and Sons, Chichester, United Kingdom) Google Scholar
• Murthy S. Synergy in cooperating agents: Designing manipulators from task specifications. (1992) (Carnegie Mellon University, Pittsburgh, Pennsylvania) . PhD thesisGoogle Scholar
• Numao M., Morishita S. Cooperative scheduling and its application to steel-making processes. IEEE Trans. Indust. Electronics (1991) 38(2):150–155Crossref, Google Scholar
• Panwalkar S. S., Smith M. L., Koulamas C. P. A heuristic for the single machine tardiness problem. Eur. J. Oper. Res. (1993) 70(3):304–310Crossref, Google Scholar
• Pickard G. C. Paper machine scheduling yields gains at James River Naheola Mill. Pulp and Paper (1997) 71(9):125–129Google Scholar
• Pierce J. F.Some Large-Scale Production Scheduling Problems in the Paper Industry (1964) (Prentice Hall, Englewood Cliffs, New Jersey) Google Scholar
• Reddy R. The challenge of artificial intelligence. IEEE Comput. (1996) 29(10):86–98Crossref, Google Scholar
• Salman F. S., Kalagnanam J., Murthy S. Cooperative strategies for solving the bicriteria sparse multiple knapsack problem. (1997) . IBM research report RC 21059 (94164)Google Scholar
• Shaw M. Madison streamlines business processes with integrated information system. Pulp and Paper (1998) 72(5):73–81Google Scholar
• Smith F. S., Ow P. S., Muscettola N., Potwin J., Matthys D. C. An integrated framework for generating and revising factory schedules. J. Oper. Res. Soc. (1990) 41(6):539–552Crossref, Google Scholar
• Stadtler H. A one-dimensional cutting stock problem in the aluminum industry and its solution. Eur. J. Oper. Res. (1990) 44:209–223Crossref, Google Scholar
• Steuer R. E.Multiple Criteria Optimization: Theory, Computation, and Applications (1989) (Robert E. Krieger Publishing, Malabar, Florida) Google Scholar
• Swaminathan J. M., Smith S. F., Sadeh N. M. A multi-agent framework for modeling supply chain dynamics. (1996) Proc. NSF Res. Planning Workshop Artificial Intelligence and ManufacturingAlbuquerque, New MexicoJuneGoogle Scholar
• Talukdar S. N., Pyo S. S., Mehrotra R. Distributed processors for numerically intense problems. (1983) . Final report for Electric Power Research Institute (EPRI) Project, RP 1983-1764-3Google Scholar
• Talukdar S. N., deSouza P., Murthy S. Organizations for computer-based agents. Internat. J. Engrg. Intelligent Systems Electr. Engrg. Comm. (1993) 1(2):75–87Google Scholar
• Tsen C. K. Solving train scheduling problems using A-teams. (1995) (Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania) . PhD thesisGoogle Scholar
• Vahrenkamp R. Random search in the one-dimensional cutting stock problem. Eur. J. Oper. Res. (1992) 95:191–200Crossref, Google Scholar
• Wagner H. M.Principles of Operations Research, with Applications to Managerial Decisions (1969) (Prentice-Hall, Englewood Cliffs, New Jersey) Google Scholar
• Wascher G. An LP-based approach to cutting stock problems with multiple objectives. Eur. J. Oper. Res. (1990) 44:175–184Crossref, Google Scholar
• Yu P. L.Multiple-Criteria Decision Making (1985) (Plenum Press, New York) Crossref, Google Scholar