By Topic

Advanced Software Technologies for Scheduling, IEE Colloquium on

Date 26 Apr 1993

Filter Results

Displaying Results 1 - 8 of 8
  • The future of scheduling-DAI?

    Publication Year: 1993 , Page(s): 8/1 - 8/2
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (124 KB)  

    It appears that AI scheduling research is moving outwards in a number of different directions: constraint-based reasoning, distributed AI, stochastic search, iterative repair, look-ahead techniques. The author is not suggesting that the community is `pulling apart', merely that the net is being thrown further, and to good effect. He believes that there is another promising direction to be explored... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Uncertainty in scheduling: probability, problem reduction, abstractions and the user

    Publication Year: 1993 , Page(s): 7/1 - 7/4
    Cited by:  Papers (3)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (260 KB)  

    In most realistic scheduling situations, the information available to the decision-maker is both incomplete and uncertain. This complicates the automation of intelligent reasoning systems in the real world. The author discusses the issues involved in reasoning in uncertain environments and argues that scheduling is essentially a problem of decision-making under uncertainty. She classifies various ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object oriented constraint programming for transportation problems

    Publication Year: 1993 , Page(s): 4/1 - 413
    Cited by:  Patents (22)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (484 KB)  

    Constraint satisfaction techniques are a very powerful way to tackle highly combinatorial problems such as vehicle routing or crew scheduling. The author presents PECOS, an object oriented constraint programming library, used in various industrial applications, including transportation. It is available in two versions: a C++ library, or a Lisp library. PECOS offers some unique aspects such as: obj... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of scheduling problems and selection of corresponding constraint-based techniques

    Publication Year: 1993 , Page(s): 1/1 - 1/3
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (204 KB)  

    It has been argued that the use of constraint-based techniques and tools allows the implementation of precise, flexible, efficient and extensible scheduling systems: precise and flexible as the system can take into account any constraint expressible in the constraint language; efficient in as much as highly optimized constraint propagation procedures are now available; extensible as the considerat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two problems-two solutions: one system-ECLIPSE

    Publication Year: 1993 , Page(s): 3/1 - 3/3
    Cited by:  Papers (1)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (180 KB)  

    The constraint logic programming system ECLiPSe is discussed. Computation in ECLiPSe alternates between two modes: constraint handling and host program execution. The host programming language is (an extended) Prolog, which handles search, and interaction with the programming environment. The control for host program execution mode is the usual Prolog c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RAMSES: decision-aid for the security of the 1992 Winter Olympic Games

    Publication Year: 1993 , Page(s): 6/1 - 610
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (384 KB)  

    Over a million spectators descended on Albertville in France for the Winter Olympic Games in February 1992. Two billion more watched the Games on television. France was in the limelight, and everything had to run smoothly. The venue made security and safety very difficult. In the event of any calamity or accident, the security forces would have to be rapidly redeployed from their normal duties. If... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using heuristics for constraint satisfaction problems in scheduling

    Publication Year: 1993 , Page(s): 2/1 - 2/3
    Cited by:  Patents (1)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (188 KB)  

    Scheduling problems such as job shop scheduling and timetabling can be expressed as constraint satisfaction problems (CSPs) and so are, at least in theory, amenable to solution by standard constraint satisfaction algorithms. Unfortunately, CSPs (and most scheduling problems) are in general NP-complete. Hence we should expect the time required to solve a CSP to increase exponentially with the size ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEE Colloquium on `Advanced Software Technologies for Scheduling' (Digest No.163)

    Publication Year: 1993
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (268 KB)  

    The following topics were dealt with: classification of scheduling problems and constraint-based techniques; heuristics for constraint satisfaction problems; ECLIPSE, constraint logic programming system; object-oriented constraint programming for transportation problems; RAMSES decision-aid for security; uncertainty in scheduling; and the future of scheduling and AI View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.