Rough Scheduling: A Research Problem

Proceedings of the Joint Conference on Information Sciences

Volumn 5, Issue 1, 2000, Pages 162-165

  Johnson, Julia ^a  

^a UNIVERSITY OF REGINA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS AGENTS; CONSTRAINT THEORY; DATABASE SYSTEMS; KNOWLEDGE REPRESENTATION; NATURAL LANGUAGE PROCESSING SYSTEMS; OPTIMIZATION; PETRI NETS; PROBLEM SOLVING; SCHEDULING; SOFTWARE AGENTS;

FEASIBLE SCHEDULE CONSTRUCTION; HUMAN AGENT-MACHINE AGENT INTERACTIONS;

ROUGH SET THEORY;

EID: 1642304109     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. S.G. Abraham, V. Kathail, and B.L. Beitrich. Meld scheduling: A technique for relaxing scheduling constraints. International Journal of Parallel Programming, 26(4):349-381, 1998.
2. M.C. Agar and S. Salhi. Lagrangean heuristics applied to a variety of large capacitated plant location problems. Journal of the Operational Research Society, 49(10):1072-1084, 1998.
3. C. Aravindan, J. Dix, and I. Niemela. A research project on disjunctive logic programming. AI Communications, 10:151-165, 1997.
4. th Conference on Applied Natural Language Processing, pages 25-32, 1997.
5. D. Carmel and S. Markovitch. Model-based learning of interaction strategies in multi-agent systems. Journal of Experimental and Theoretical AI, 10(3):309-332, 1998.
6. B. Chen, C.N. Potts, and V.A. Strusevich. Approximation algorithms for two-machine flow shop scheduling with batch set up times. Mathematical Programming, 82:255-271, 1998.
7. L. Chen and J.A. Johnson. Relation nets and database query. In Proceedings of the 3rd Pacific Rim International Conference, on Artificial Intelligence, pages 752-758, Beijing, China, 1994.
8. L.A. Hall. Approximability of flow shop scheduling. Math. Programming, 82:175-190, 1998.
9. J. Johnson. Rough mereology for industrial design. In L. Polkowski and A. Skowron, editors, Rough Sets and Current Trends in Computing, pages 553-556. Springer, 1998.
10. J. Johnson and L. Chen. Relation nets for production scheduling in manufacturing. In G. Rzevski, P.A. Adey, and D.W. Russell, editors, Applications of AI in Engineering IX, pages 586-592. Computational Mechanics, 1994.
11. th Joint Conference in Information Science JCIS'98, volume II, pages 367-370, 1998.
12. th International Conference on Computing and Information, pages 53-60, 1998.
13. J.A. Johnson. Optimization without computation: An application of artificial intelligence to product scheduling in manufacturing. In Fourth National Conference on Robotics, volume 1, pages 235-242, 1993.
14. J.A. Johnson. Semantic relatedness. Computers & Math. with Applications, 29(5):51-64, 1995.
15. th International Conference Information Systems Development - ISD'96, pages 193-203, 1996.
16. J.A. Johnson and R.S. Rosenberg. Knowledge sharing for natural language understanding and conceptual modeling for database design. In Proc. PRICAI'92, pages 980-988, 1992.
17. J.A. Johnson and R.S. Rosenberg. A measure of semantic relatedness for resolving ambiguities in natural language database requests. Data & Knowledge Engineering, 7(3):201-225, 1992.
18. rd Pacific Rim International Conference on Artificial Intelligence, pages 635-641, Beijing, China, 1994.
19. O.-H. Kwon and K.-Y. Chwa. An algorithm for scheduling jobs in hypercube systems. IEEE Transactions on Parallel and Distributed Systems, 9(9):856-860, 1998.
20. K. Marriott and P. Stuckey, editors. J. Logic Programming: Special Issue on Constraint Logic Programming, volume 37. North-Holland, 1998.
21. K. Marriott and P. Stuckey. Programming with Constraints: An Introduction. MIT Press, Cambridge, Mass., 1998.
22. Lech Polkowski and Andrzej Skowron. Rough mereology: A new paradigm for approximate reasoning. Int. Journal of Approximate Reasoning, 15(4):333-365, 1996.
23. V.A. Saraswat, R. Jagadeesan, and V. Gupta. Default timed concurrent constraint programming. In Proceedings POPL'95, 1995.
24. Andrzej Skowron and Lech Polkowski. Rough mereology and analytical morphology. In E. Orlowska, editor, Incomplete Information: Rough Set Analysis, chapter 13, pages 399-437. Physica Verlag, 1998.
25. Andrzej Skowron and Lech Polkowski. Rough mereology foundations for design, analysis, synthesis, and control in distributed systems. Information Sciences, 104(1-2), 1998.
26. P.G. Surette and R.E. Mercer. Towards defining presuppositions in a Montague grammar-like framework. In Proceedings Pacific Association for Computaional Linguists, pages 335-349, 1999.