4Adams J, Balas E, Zawack D. The shifting bottleneck procedure for job shop scheduling [J]. Management Science, 1988,34 (3): 391-401.
5Solimanpura M,Vratb P, Shankarc tL. A heuristic to minimize makespan of cell scheduling problem [J ]. International Journal ofProduction Economics, 2004,88(3) : 231?241.
6Allahverdi A. A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tar- diness [J]. Computers and Operations Research,2004,31 (2): 157-180.
7Welbank M. A Review of Knowledge Acquisition Techniques for Expert Systems, Technical Report, British Telecommunications Research Laboratories, Ipswich, England, 1983.
8Fox M S,Allen B P,Smith S F,Strohm G A. ISIS:a Con- straint-Directed Reasoning Approach to Job Shop Scheduling. Technical Report CMU-RI-TR-83-8, Carnegie-Mellon Uni- versity,USA, 1983.
9Brailsford S C ,Potts C N, Smith B M. Constraint satisfaction problems: algorithms and applications [J ]. European Journal of Op- erational Research, 1999,119(3) : 557-581.
10Hayes-Roth B. Agents on Stage: Advancing the State of the Art of AI,Technical Report KSL-95-50, Knowledge Systems Laboratory, Canada, 1995.
