Proceedings Article10.1109/ISIC.1999.796662
Intelligent scheduling of chemical plants: a constraint programming approach
M. Stobbe,S. Engell +1 more
- 01 Jan 1999
- pp 242-247
6
TL;DR: The applicability of constraint programming to the task of scheduling batch and mixed batch/continuous plants in the chemical industry is investigated and an architecture for a reactive scheduling system is outlined.
read more
Abstract: The applicability of constraint programming to the task of scheduling batch and mixed batch/continuous plants in the chemical industry is investigated. The main features of constraint programming are described, emphasizing possible advantages when applied to the scheduling task. Based on the results, an architecture for a reactive scheduling system is outlined. The underlying strategy for developing a problem specific solution approach is described and applied to a real-world problem. Emphasis is given to the advantages gained by the use of a constraint programming language.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Modeling and solving real-time scheduling problems by stochastic integer programming
Guido Sand,Sebastian Engell +1 more
TL;DR: The application of two-stage stochastic integer programming techniques on moving horizons is proposed to solve scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character.
112
A hybrid evolutionary algorithm for solving two-stage stochastic integer programs in chemical batch scheduling ☆
TL;DR: A new hybrid algorithm is proposed to solve 2-SIPs based on stage decomposition: an evolutionary algorithm performs the search on the first-stage variables while the second-stage subproblems are solved by mixed-integer programming.
72
Engineered versus standard evolutionary algorithms: A case study in batch scheduling with recourse
TL;DR: An efficient engineered evolutionary algorithm is developed which is shown to cover the feasible set significantly better such that a high quality feasible schedule can be generated comparatively fast.
27
Design of problem-specific evolutionary algorithm/mixed-integer programming hybrids: two-stage stochastic integer programming applied to chemical batch scheduling
TL;DR: A problem-specific EA for process engineering task is designed, following the MBEA guidelines and minimal moves mutation, and is compared to a straightforward application of a canonical EA/MIP and to a monolithic mathematical programming algorithm.
16
References
A General Algorithm for Short-Term Scheduling of Batch Operations-I. MILP Formulation
TL;DR: In this article, a general framework for handling a wide range of scheduling problems arising in multiproduct/multipurpose batch chemical plants is presented, where the use of utilities by the various tasks may vary over the task processing time, and may be constant or proportional to the batchsize.
1.1K
The Oz Programming Model
Gert Smolka
- 30 Sep 1996
TL;DR: The Oz Programming Model is a concurrent programming model subsuming higher-order functional and object-oriented programming as facets of a general model and can be extended so that it can express encapsulated problem solvers generalizing the problem solving capabilities of constraint logic programming.
A General Algorithm for Scheduling Batch Operations
E. Kondili,C.C. Pantelides,Rwh Sargent +2 more
- 01 Jan 1988
85
Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation
Yves Caseau,François Laburthe +1 more
- 03 Jul 1995
TL;DR: Task intervals were defined in [CL94] for disjunctive scheduling so that, in a scheduling problem, one could derive much information by focusing on some key subsets of tasks.
49
Sequencing of batch operations for a highly coupled production process: Genetic algorithms versus mathematical programming
TL;DR: In this paper, the application of a genetic algorithm to a real-world scheduling problem with highly coupled production is presented, where special attention is paid to the handling of constraints at different levels of the implementation of the algorithm.
38