The PCP: A predictive model for satisfying conflicting objectives in scheduling problems

Artificial Intelligence in Engineering - Tập 7 - Trang 227-242 - 1992
Pauline M. Berry1
1Centre Universitaire d'Informatique, University of Geneva, 12 Rue Du Lac, Ch-1207, Geneva, Switzerland

Tài liệu tham khảo

Adam, 1986

Baker, 1974

Burke, 1989, A distributed asynchronous system for predictive and reactive scheduling

Conway, 1967

Elleby, 1988, From AI laboratory to factory floor: the story of the S2 scheduling system

Elleby, 1988, A constraint-based scheduling system for VLSI wafer fabrication

Freuder, 1982, A sufficient condition for back-track-free search, Journal of the ACM, 29, 24, 10.1145/322290.322292

Gonzalez, 1978, Preemptive scheduling of uniform processor systems, Journal Association for Computing Machinery, 15, 92, 10.1145/322047.322055

Haralick, 1980, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, 14, 263, 10.1016/0004-3702(80)90051-X

Karp, 1975, On the computational complexity of combinatorial problems, Networks, 5, 45, 10.1002/net.1975.5.1.45

Kivenko, 1981

LePape, 1985, SOJA: A daily workshop scheduling system, 195

Ow, 1986, Toward an opportunistic scheduling system

Panwalker, 1977, A survey of scheduling rules, Operations Research, 25, 45, 10.1287/opre.25.1.45

Prosser, 1989, A reactive scheduling agent, 1004

Purdom, 1983, Search rearrangement back-tracking and polynomial average time, Artificial Intelligence, 21, 117, 10.1016/S0004-3702(83)80007-1

Rickel, 1988, Issues in the design of scheduling systems, 70

Smith, 1988, Assumption-based truth maintenance and the forward checking algorithm

Smith, 1986, Integrating multiple scheduling perspectives to generate detailed production plans

Spachis, 1979, Probabilistic and worst-case analysis of single-pass scheduling heuristics

Sycara, 1991, Resource Allocation in Distributed Factory Scheduling, IEEE Expert, 29, 10.1109/64.73815