This Article 
 Bibliographic References 
 Add to: 
A Generic Library of Problem Solving Methods for Scheduling Applications
June 2006 (vol. 18 no. 6)
pp. 815-828
In this paper, we propose a generic library of problem-solving methods for scheduling applications. Although some attempts have been made in the past at developing the libraries of scheduling problem-solvers, these only provide limited coverage. Many lack generality, as they subscribe to a particular scheduling domain. Others simply implement a particular problem-solving technique, which may be applicable only to a subset of the space of scheduling problems. In addition, most of these libraries fail to provide the required degree of depth and precision. In our approach, we subscribe to the Task-Method-Domain-Application knowledge modeling framework which provides a structured organization for the different components of the library. At the task level, we construct a generic scheduling task ontology to formalize the space of scheduling problems. At the method level, we construct a generic problem-solving model of scheduling that generalizes from the variety of approaches to scheduling problem-solving, which can be found in the literature. The generic nature of this model is demonstrated by constructing seven methods for scheduling as an alternative specialization of the model. Finally, we validated our library on a number of applications to demonstrate its generic nature and effective support for developing scheduling applications.

[1] J.F. Allen, “Maintaining Knowledge about Temporal Intervals,” Comm. ACM, vol. 26, no. 11, pp. 832-843, 1983.
[2] J. Angele, D. Fensel, D. Landes, and R. Studer, “Developing Knowledge-Based System with MIKE,” Automated Software Eng., vol. 5, no. 4, pp. 389-418, 1998.
[3] K.R. Baker, Introduction to Sequencing and Scheduling. John Wiley and Sons, 1974.
[4] J.C. Beck and M.S. Fox, “A Generic Framework for Constraint-Directed Search and Scheduling,” AI Magazine, vol. 19, no. 4, pp. 101-130, 1998.
[5] V.R. Benjamins, “Problem Solving Methods for Diagnosis,” PhD dissertation, Dept. of Social Sciences Informatics, Univ. of Amsterdam, The Netherlands, 1993.
[6] J. Breuker and W. Van de Velde, CommonKADS Library for Expertise Modelling. Amsterdam: IOS Press, 1994.
[7] V. Brusoni, L. Console, E. Lamma, P. Mello, M. Milano, and P. Terenziani, “Resource-Based vs. Task-Based Approaches for Scheduling Problems,” Proc. Ninth Foundations of Intelligent Systems (ISMIS '96), pp. 325-334, 1996.
[8] P. Burke, “Scheduling in Dynamic Environments,” PhD dissertation, Univ. of Strathclyde, U.K., 1989.
[9] P. Burke and P. Prosser, “A Distributed Asynchronous Scheduler,” Intelligent Scheduling, M. Zweben and M.S. Fox, eds., chapter 11, pp. 309-339, San Francisco: Morgan Kauffman, 1994.
[10] B. Chandrasekaran, “Generic Tasks in Knowledge-Based Reasoning: High-Level Building Blocks for Expert System Design,” IEEE Expert, vol. 1, pp. 23-30, 1986.
[11] B. Chandrasekeran and S. Mittal, “Deep versus Compiled Knowledge Approaches to Diagnostic Problem-Solving,” Int'l J. Human-Computer Studies, vol. 51, no. 2, pp. 357-368, 1999.
[12] E. Coelho and G. Lapalme, “Describing Reusable Problem-Solving Methods with a Method Ontology,” Proc. 10th Knowledge Acquisition for Knowledge-Based Systems Workshop, B.R. Gaines and M. Musen, eds., pp. 1-20, 1996.
[13] A. Collinot, C. Le Pape, and G. Pinoteau, “SONIA: A Knowledge-Based Scheduling System,” Artificial Intelligence in Eng., vol. 3, no. 2, pp. 86-94, 1988.
[14] R. Dechter and I. Meiri, “Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems,” Proc. 11th Int'l Joint Conf. Artificial Intelligence (IJCAI '89), pp. 271-277, 1989.
[15] J. Dorn and W. Slany, “A Flow Shop Compatibility Constraints in a Steel Manufacturing Plant,” Intelligent Scheduling, M. Zweben and M.S. Fox, eds., chapter 22, pp. 629-654, San Francisco: Morgan Kauffman, 1994.
[16] J. Domingue, E. Motta, and S. Watt, “The Emerging VITAL Workbench,” Proc. Seventh European Workshop Knowledge Acquisition for Knowledge-Based Systems, N. Aussenac, G. Boy, B.R. Gaines, M. Linster, J.-G. Ganascia, and Y. Kodratoff, eds., pp. 320-339, 1993.
[17] A. Farquhar, R. Fikes, and J. Rice, “The Ontolingua Server: A Tool for Collaborative Ontology Construction,” Int'l J. Human-Computer Studies, vol. 46, no. 6, pp. 707-728, 1997.
[18] D. Fensel, “Assumptions and Limitations of Problem-Solving Method: A Case Study,” Proc. Ninth Banff Knowledge Acquisition for Knowledge-Based Systems Workshop, B. Gaines and M. Musen, eds., 1995.
[19] D. Fensel and R. Straatman, “The Essence of Problem-Solving Methods: Making Assumptions to Gain Efficiency,” Int'l J. Human-Computer Studies, vol. 48, pp. 181-215, 1998.
[20] D. Fensel and E. Motta, “Structured Development of Problem Solving Methods,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 6, pp. 913-932, Nov./Dec. 2001.
[21] M.S. Fox, “An Organisation View of Distributed Systems,” IEEE Trans. Systems, Man, and Cybernetics, vol. 11, pp. 70-80, 1981.
[22] M.S. Fox and S. Smith, “ISIS: A Knowledge-Based System for Factory Scheduling,” Int'l J. Expert Systems, vol. 1, no. 1, pp. 25-49, 1984.
[23] M.S. Fox and N. Sadeh, “Why Scheduling is Difficult? A CSP Perspective,” Proc. Ninth European Conf. Artificial Intelligence (ECAI '90), pp. 754-767, 1990.
[24] B.R. Fox and K.G. Kempf, “Planning, Scheduling, and Uncertainty in the Sequence of Future Events,” Proc. Second Ann. Conf. Uncertainty in Artificial Intelligence (UAI '86), pp. 395-402, 1986.
[25] E.C. Freuder, “A Sufficient Condition for Backtrack-Free Search,” J. ACM, vol. 29, no. 1, pp. 24-32, 1982.
[26] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., 1979.
[27] F. Glover, “Future Paths for Integer Programming and Links to Artificial Intelligence,” Computers and Operations Research, vol. 13, no. 5, pp. 533-549, 1986.
[28] T.J. Grant, “Lessons for OR from AI: A Scheduling Case Study,” J. Operations Research Soc., vol. 37, pp. 41-57, 1986.
[29] T.R. Gruber, “A Translation Approach to Portable Ontologies,” Knowledge Acquisition, vol. 5, no. 2, pp. 199-220, 1993.
[30] A. Gomez-Perez and V.R. Benjamins, “Applications of Ontologies and Problem Solving Methods,” AI Magazine, vol. 20, no. 1, pp. 119-122, 1999.
[31] N. Guarino, “Understanding, Building and Using Ontologies,” Int'l J. Human-Computer Studies, vol. 46, nos. 2-3, pp. 293-310, 1997.
[32] K. Hadavi, W-L. Hsu, T. Chen, and C-N. Lee, “An Architecture for Real-Time Distributed Scheduling,” AI Magazine, vol. 13, no. 3, pp. 46-56, 1992.
[33] R.M. Haralick and G.L. Elliott, “Increasing Tree Search Efficiency for Constraint Satisfaction Problems,” Artificial Intelligence, vol. 14, pp. 263-313, 1980.
[34] M. Hori, Y. Nakamura, H. Satoh, K. Maruyama, T. Hama, S. Honda, T. Takenaka, and F. Sekine, “Knowledge-Level Analysis for Eliciting Composable Scheduling Knowledge,” Artificial Intelligence in Eng., vol. 9, no. 4, pp. 253-264, 1995.
[35] M. Hori and T. Yoshida, “Domain-Oriented Library of Scheduling Methods: Design Principle and Real-Life Application,” Int'l J. Human-Computer Studies, vol. 49, pp. 601-626, 1998.
[36] K. Kempf, C. Le Pape, S.F. Smith, and B.R. Fox, ”Issues in the Design of AI-Based Schedulers: A Workshop Report,” AI Magazine, vol. 11, no. 5, pp. 37-46, 1991.
[37] C. Kruger, “Software Reuse,” Computing Surveys, vol. 24, no. 2, pp. 131-183, 1992.
[38] C. Le Pape, “Implementation of Resource Constraints in ILOG SCHEDLE: A Library for the Development of Constraint-Based Scheduling Systems,” Int'l Systems Eng., vol. 3, no. 2, pp. 55-66, 1994.
[39] S. Marcus, Automatic Knowledge Acquisition for Expert Systems. Kluwer Academic, 1988.
[40] S. Marcus, J. Stout, and J. McDermott, “VT: An Expert Elevator Designer that Uses Knowledge-Based Backtracking,” AI Magazine, vol. 9, no. 1, pp. 95-111, 1988.
[41] S. Marcus and J. McDermott, “SALT: A Knowledge Acquisition Language for Propose-and-Revise Systems,” Artificial Intelligence, vol. 39, no. 1, pp. 1-37, 1989.
[42] J. McDermott, “Towards a Taxonomy of Problem Solving Methods,” Automating Knowledge Acquisition for Expert Systems, S. Marcus, ed. Kluwer Academic, 1988.
[43] D.L. McGuinness and F. van Hermelen, “OWL Web Ontology Language Overview,” W3C Recommendation, http://www.w3c. org/TR/2004REC-owl-guide-20040210 /, Feb. 2004.
[44] R. Mizoguchi, J. Vanwelkenhuysen, and M. Ikeda, “Task Ontology for Reusable Problem Solving Knowledge,” Towards Very Large Knowledge Bases, pp. 46-57, IOS Press, 1995.
[45] D.H. Mott, J. Cunningham, G. Kelleher, and J.A. Gadsden, “Constraint-Based Reasoning for Generating Naval Flying Programmes,” Expert Systems, vol. 3, no. 2, pp. 226-246, 1988.
[46] E. Motta, Reusable Components for Knowledge Modelling: Principles and Case Studies in Parametric Design. Amsterdam: IOS Press, 1999.
[47] E. Motta, D. Rajpathak, Z. Zdrahal, and R. Roy, “The Epistemology of Scheduling Problems,” Proc. 15th European Conf. Artificial Intelligence (ECAI '02), F. van Harmelen, ed., pp. 215-219, 2002.
[48] M. Musen, S.W. Tu, H. Eriksson, J.H. Gennari, and A.R. Puerta, “PROTÉGÉ-II: An Environment for Reusable Problem-Solving Methods and Domain Ontologies,” Proc. 13th Int'l Joint Conf. Artificial Intelligence (IJCAI '93), 1993.
[49] R. Neches, R.E. Fikes, T. Finin, T.R. Gruber, T. Senator, and W.R. Swartout, “Enabling Technology for Knowledge Sharing,” AI Magazine, vol. 12, no. 3, pp. 36-56, 1991.
[50] A. Newell and H. Simon, “Computer Science as Empirical Enquiry: Symbols and Search,” Comm. ACM, vol. 19, no. 3, pp. 113-126, 1976.
[51] S.S. Panwalkar and W. Iskander, “A Survey of Scheduling Rules,” Operations Research, vol. 25, no. 1, pp. 45-61, 1977.
[52] H. Parunak, B. Irish, J. Kindrick, and P. Lozo, “Fractal Actors for Distributed Manufacturing Control,” Proc. Second IEEE Conf. Artificial Intelligence Applications, pp. 653-660, 1985.
[53] K. Poeck and F. Puppe, “COKE: Efficient Solving of Complex Assignment Problems with the Propose-and-Exchange Method,” Proc. Fifth Int'l Conf. Tools with Artificial Intelligence, pp. 136-143, 1992.
[54] P. Prosser and I. Buchanan, “Intelligent Scheduling: Past, Present, and Future,” Int'l Systems Eng., vol. 3, no. 2, pp. 67-78, 1994.
[55] D. Rajpathak, E. Motta, Z. Zdrahal, and R. Roy, “A Generic Library of Problem Solving Methods for Scheduling Applications,” Proc. Second Int'l Conf. Knowledge Capture (K-CAP '03), pp. 113-120, 2003.
[56] D. Rajpathak, “A Generic Library of Problem Solving Methods for Scheduling Applications,” PhD dissertation, Knowledge Media Inst., The Open Univ., U.K., 2004.
[57] A. Ravidran, D.T. Philips, and J.J. Solberg, Operations Research Principles and Practice. John Wiley and Sons Inc., 1987.
[58] T. Runkel, W.B. Birmingham, and A. Balkany, “Solving VT by Reuse,” Int'l J. Human-Computer Studies, vol. 44, nos. 3/4, pp. 403-433, 1996.
[59] N. Sadeh, “Micro-Opportunistic Scheduling: The Micro-Boss Factory Scheduler,” Intelligent Scheduling, M. Zweben and M.S. Fox, eds, chapter 4, pp. 99-135, San Fracisco: Morgan Kauffman, 1994.
[60] J. Saucer, “Knowledge-Based Design of Scheduling Systems,” Int'l J. Intelligent Automation and Soft Computing, vol. 7, no. 1, pp. 55-62, 1997.
[61] G. Schreiber, B. Wielinga, R. De Hogg, H. Akkermans, and W. Van de Velde, “CommonKADS: A Comprehensive Methodology for KBS Development,” IEEE Expert, vol. 9, no. 6, pp. 28-37, 1999.
[62] S.D. Sharma, Operations Research. Meerut, India: Kedarnath-Ramnath and Co., 1996.
[63] J.R. Slagle and H. Hamburger, “An Expert System for a Resource Allocation Problem,” Comm. ACM, vol. 28, no. 9, pp. 994-1004, 1985.
[64] S. Smith, P.S. Ow, N. Muscettola, J.Y. Potvin, and D. Matthys, “OPIS: An Opportunistic Factory Scheduling System,” Proc. Third Int'l Conf. Industrial and Eng. Appications of Artificial Intelligence and Expert Systems, May 1990.
[65] S.F. Smith, “Reactive Scheduling Systems,” Intelligent Scheduling Systems, D.E. Brown and W.T. Scherer, eds., Kluwer Press, 1995.
[66] S. Smith and M.A. Becker, “An Ontology for Constructing Scheduling Systems,” Working Notes of AAAI Symp. Ontological Eng., 1997.
[67] L. Steels, “Components of Expertise,” AI Magazine, vol. 11, pp. 28-49, 1990.
[68] J. Stout, G. Caplain, S. Marcus, and J. McDermott, “Towards Automating Recognition of Differing Problem-Solving Demands,” Int'l. J. Man Machine Studies, vol. 29, no. 5, pp. 599-611, 1988.
[69] U. Sundin, “Assignment and Scheduling,” CommonKADS Library for Expertise Modelling, J. Breuker and W. Van de Velde, eds. Amsterdam: IOS Press, pp. 231-263, 1994.
[70] B. Swartout and Y. Gil, “EXPECT: Explicit Representations for Flexible Acquisition,” Proc. Ninth Knowledge Acquisition for Knowledge-Based Systems Workshop, 1995.
[71] P. Terpstra, G. van Heijst, B. Wielinga, and N. Shadbolt, “Knowledge Acquisition Support through Generalised Directive Models,” Second Generation Expert Systems, J.M. David, J.P. Krivine, and R. Simmons, eds. Springer-Verlag, pp. 428-455, 1993.
[72] Y.A. Tijerino and R. Mizoguchi, “MULTIS II: Enabling End-Users to Design Problem-Solving Engines via Two-Level Task Ontologies,” Proc. Seventh European Workshop Knowledge Acquisition for Knowledge-Based Systems (EKAW '93), N. Aussenac-Gilles, G.A. Boy, B.R. Gaines, J. Ganascia, Y. Kodratoff, and M. Linster, eds., 1993.
[73] A. Valente, V.R. Benjamins, and L. Nunes de Barross, “A Library of System-Derived Problem-Solving Methods for Planning,” Int'l J. Human-Computer Studies, vol. 48, no. 4, pp. 417-447, 1998.
[74] G. van Heijst, P. Terpstra, B.J. Wielinga, and N. Shadbolt, “Using Generalised Directive Models in Knowledge Acquisition,” Proc. Sixth European Knowledge Acquisition Workshop, pp. 112-132, 1992.
[75] B. Wielinga, J.M. Akkermans, and A.T. Schreiber, “A Formal Analysis of Parametric Design Problem Solving,” Proc. Ninth Banff Knowledge Acquisition Workshop for Knowledge-Based System (KAW '94), B.R. Gaines and M.A. Musen, eds. 1995.

Index Terms:
Knowledge modeling, knowledge engineering, knowledge-based systems, task-method-domain-application modeling, ontologies, problem solving methods, scheduling.
Dnyanesh G. Rajpathak, Enrico Motta, Zdenek Zdrahal, Rajkumar Roy, "A Generic Library of Problem Solving Methods for Scheduling Applications," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 6, pp. 815-828, June 2006, doi:10.1109/TKDE.2006.85
Usage of this product signifies your acceptance of the Terms of Use.