Interactive scheduling in the chemical process industry

Computers and Chemical Engineering

Volumn 21, Issue 9, 1997, Pages 925-945

  Dockx, Kris ^a   De Boeck, Yvan ^a   Meert, Kürt ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL INDUSTRY; CONSTRAINT THEORY; DECISION SUPPORT SYSTEMS; HEURISTIC METHODS; HUMAN COMPUTER INTERACTION; INTERACTIVE COMPUTER SYSTEMS; RANDOM PROCESSES; SCHEDULING;

CHEMICAL PROCESS INDUSTRY (CPI); SOFTWARE PACKAGE SKYE;

PROCESS CONTROL;

EID: 0031153682     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(96)00343-2     Document Type: Article

References (46)

1. Baker K. R., Introduction to sequencing and scheduling, J. Wiley and Sons, New York (1974).
2. Biegel, J. E. and Davern, J. J. (1990) Genetic Algorithms and Job Shop Scheduling. Computers and Ind. Eng 19(1-4), 81-91.
3. Brown D. E. and Scherer W. T., Intelligent scheduling systems, Kluwer Academic Publishers, (1995).
4. Cheeseman, P., B. Kanefsky, and W.M. Taylor, Where the Really Hard Problems Are, Proceedings IJCAI-91 1 (1991) 331-337.
5. Das, H., Cummings, P. T. and Le Van, M. D. (1990) Scheduling of serial multiproduct batch processes via Simulated annealing. Computers chem. Engng 14, 1351-1362.
6. Deal, D. E., Yang, T. and Hallquist, S. (1994) Job scheduling in petrochemical production: two-stage processing with finite intermediate storage. Computers chem. Engng. 18, 333-344.
7. Dockx K. and M. Rijckaert, Temporal reasoning in knowledge-based process control, IEE colloquium on temporal reasoning, January, (1990).
8. Dockx, K. and Timmermans, R. (1992) Adding a temporal dimension to expert systems working in a real-time environment. CCAII 9(2-3), 253-259.
9. Dockx, K. and Meert, K. (1993) Production scheduling in a chemical process environment based on a simulated annealing algorithm. Journal A 34(3), 41-46.
10. Dockx K. and J. F. Lutsko, SA/GA: Survival of the fittest in Alaska, Fourth International Workshop on Artificial Intelligence and Statistics, Ft Lauderdale, Fl, January, 219-224 (1993).
11. Dockx K., K. Meert and B. Kuijpers, Production Scheduling in a Chemical Process Environment Based on Simulated Annealing, AAAI SIGMAN Workshop, New Orleans, November (1994).
12. Dorn J., Case-based reactive scheduling, Artificial Intelligence in Reactive Scheduling, Kerr R., Szelke E., editors, 32-50 (1995).
13. Fischer, R. and Tippet, L. (1928) Limiting forms of the frequency distribution of the largest or smallest member of a sample. Proc. Camb. Phil. Soc. 24, 180-190.
14. Fox, M. S. and Smith, S. F. (1984) ISIS - a knowledge-based system for factory scheduling. International Journal of Expert Systems 1, 25-49.
15. Fox M. S. and N. Sadeh, Why is scheduling difficult? A CSP perspective, Proceedings of the European Conference on AI, 754-767 (1990).
16. Freuder E., Backtrack-Free and Backtrack Bounded Search, Search in Artificial Intelligence, L. Kanal and V. Kumar, editors, Springer-Verlag, New York, 343-369 (1988).
17. Garey M. R. and Johnson D. S. Computers and intractability: A guide to the theory of NP-Completeness, Freeman, San Francisco (1979).
18. Golden, B. L. (1977) A Statistical Approach to the TSP. Networks 7, 209-225.
19. Gooding, W. B., Pekny, J. F. and McCroskey, P. S. (1994) Enumerative approaches to parallel flow-shop scheduling via problem transformation. Computers chem. Engng 18, 909-927.
20. Johnston M. D. and S. Minton, Analyzing a heuristic strategy for Constraint-Satisfaction and Scheduling, Intelligent Scheduling, M. Zweben, M. S. Fox, editors, 257-290 (1995).
21. Jung, J. H., Ho-Kyung, L., Ryook, D. and In-Beum, L. (1994) Completion times and optimal scheduling for serial multi-product process with transfer and set-up times in zero-wait policy. Computers chem. Engng. 18, 537-544.
22. Kanev, K. and Dockx, K. (1994) A framework for graphically-oriented human computer interactions in intelligent operator support systems. Comput. & Graphics 18(4), 563-570.
23. Karimi I. A. and S. Hasebe, Chemical Batch Process Scheduling, Adaption of Simulated Annealing to Chemical Optimization Problems, Kalivas J. H., editor, Elsevier Science B. V., 181-203 (1995).
24. Kerr R. and E. Szelke, Artificial Intelligence in Reactive Scheduling, Chapman and Hall, London (1995).
25. Knopf, F. C. (1985) Sequencing a generalised two-stage flow shop with finite and intermediate storage. Computers chem. Engng. 9, 207-221.
26. Kondili, E., Pantelides, C. C. and Sargent, R. W. H. (1993) A general algorithm for short term scheduling of batch operations - I MILP formulation. Computers chem. Engng. 17, 211-227.
27. Ku, H.-M., Rajagopalan, D. and Karimi, I. A. (1987) Scheduling in Batch Process. Chemical Engineering Progress Aug. 87, 35-45.
28. Ku, H.-M. and Karimi, I. A. (1988) Scheduling in serial multiproduct batch processes with finite interstage storage: a mixed integer linear program formulation. Ind. Eng. Chem. Res. 27, 1840-1848.
29. Ku, H.-M. and Karimi, I. A. (1991a) An evaluation of simulated annealing for batch process scheduling. Industrial and Engineering Chemistry Research 30, 163-169.
30. Ku, H.-M. and Karimi, I. A. (1991b) Scheduling algorithms for serial multiproduct batch processes with tardiness penalties. Computers chem. Engng 15, 283-286.
31. Kudva, G., Elkamel, A., Pekny, J. F. and Reklaitis, G. V. (1994) Heuristic algorithm for scheduling batch and semi-continuous plants with production deadlines, intermediate storage limitations and equipment changeover costs. Computers chem. Engng 18, 859-875.
32. Kumar, V. (1992) Algorithms for constraint satisfaction problems: a survey. AI Magazine Spring 92, 32-44.
33. Laguna, M., Barnes, J. W. and Glover, F. (1993) Intelligent scheduling with Tabu Search: an application to Jobs with Linear Delay Penalties and Sequence-Dependent Setup costs and times. Journal of Applied Intelligence 3, 159-172.
34. Mackworth, A. K. (1977) Consistency in networks of relations. Artificial Intelligence 8(1), 99-118.
35. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A. and Teller, E. (1953) Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087-1092.
36. Morton T. E. and Pentico D. W., Heuristic Scheduling Systems With Applications to Production Systems and Project Management, J. Wiley and Sons, New York (1993).
37. Pekny, J. F. and Miller, D. L. (1991) Exact solution of the no-wait flowshop scheduling problem with a comparison to heuristic methods. Computers chem. Engng 15, 741-748.
38. Rajagopalan D. and I. A. Karimi, Scheduling in serial mixed-storage multiproduct processes with transfer and set-up times, Foundations of Computer Aided Process Operations, G. V. Reklaitis, H. D. Spriggs, editors, CACHE Corporation, Elsevier, New York (1987).
39. Rubbrecht E. and Vancraenendonck, Optimale scheduling van batch processen, Eindwerk aan de Katholieke Universiteit Leuven, (1993).
40. Smith S. F., A Methodology and Architecture for Reactive Scheduling, Intelligent Scheduling, M. Zweben, M. S. Fox, editors, 29-66 (1995).
41. Van Bael P., Scheduling Chemical Batch Processes with Transfer Times and Sequence dependent Set-up Times in ZW or NIS Policy, The Second International Conference on the Practical Applications of Constraint Technology, London, UK, 453-464 (1996).
42. Van Hentenryck P., Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, MA (1989).
43. van Laarhoven P. J. M., E. H. L. Aarts, Simulated Annealing: Theory and Applications, D. Reidel Publishing Company, Dordrecht (1987).
44. Zadeh, L. A. (1969) Fuzzy algorithms. Information Control 19, 94-102.
45. Zweben M., Daun B., Davis E., Deale M., Scheduling and Rescheduling with Iterative Repair, Intelligent Scheduling, M. Zweben, M. S. Fox, editors, 241-256, (1995).
46. Zweben M. and Fox M. S., Intelligent Scheduling, Morgan Kaufmann, (1995).