O. Evans, Factory Scheduling using Finite Domains, in: Logic Programming in Action, LNCS 636, Springer-Verlag, 45--53, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Constraint Logic Programming: A Survey - Jaffar, Maher (1994) (359 citations) (Correct)
.... optic communications equipment [49] interest rate risk management in banking [97] failure mode and effect analysis of complex systems [97] development of digitally controlled analog systems [197] testing of telecommunication protocols [154] causal graph management [209] factory scheduling [85], etc. The Applause Project [167] has developed applications that use the ElipSys system for manufacturing planning, tourist advice, molecular biology, and environment monitoring and control. 72 Acknowledgements We would like to thank the following people for their comments on drafts of this ....
O. Evans, Factory Scheduling using Finite Domains, in: Logic Programming in Action, LNCS 636, Springer-Verlag, 45--53, 1992.
Over-Constrained Systems in CLP and CSP - Jampel (1996) (2 citations) (Correct)
....successful practical applications solving difficult and commercially important real world problems. Examples include scheduling for factories and for computer instruction sets; financial applications such as options and portfolio analysis; and modelling water usage, DNA, and electrical circuits [3, 10, 23, 24, 38, 39, 64, 72, 78, 79, 86]. Many problems which previously appeared local to a particular application domain, and which were therefore solved in an ad hoc manner, can now be seen as instances of constraint problems. For example, AI applications as disparate as machine vision and belief revision can now be considered in ....
O. Evans. Factory Scheduling Using Finite Domains. In G. Comyn, N. E. Fuchs, and M. J. Ratcliffe, editors, Logic Programming in Action, LNCS 636, pages 45--53. Springer, 1992.
Constraint-Based Intelligent Scheduling - Smith, Goodwin (1995) (Correct)
.... implemented in a language called the Schema Representational Language (SRL) This language is based heavily on Minsky s formal definition of frames, and hence does not map well to our implementation language clp(FD) 4 Evans Finite Domain Scheduler: A Case Study Scheduler Evans describes in [EVA92] a finite domain scheduler designed in DECISIONPOWER Prolog. Unlike SRL, DECISIONPOWER Prolog should be easily mapped to clp(FD) Evans explains that scheduling should be done in conjunction with real time input from the user. In other words, the user should be able to inform the scheduler of ....
O. Evans, (1992), Factory Scheduling using Finite Domains, In Logic Programming in Action, LNCS 636, pages 45-53, Springer-Verlag.
CHIC - Final Technical Report - (Ed.) (1995) (Correct)
No context found.
O. Evans. Factory scheduling using finite domains. In G. Comyn, N.E. Fuchs, and M. Ratcliffe, editors, Logic Programming in Action, Second International Logic Programming Summer School, LPSS'92, volume 636 of Lecture Notes in Artificial Intelligence, pages 45--53, Zurich, Switzerland, 1992. Springer Verlag.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC