The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
State-of-the-art review of optimization methods for short-term scheduling of batch processes
Open accessAbstract
There has been significant progress in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, in the last 20 years. The main goal of this paper is to provide an up-to-date review of the state-of-the-art in this challenging area. Main features, strengths and limitations of existing modeling and optimization techniques as well as other available major solution methods are examined through this paper. We first present a general classification for scheduling problems of batch processes as well as for the corresponding optimization models. Subsequently, the modeling of representative optimization approaches for the different problem types are introduced in detail, focusing on both discrete and continuous time models. A comparison of effectiveness and efficiency of these models is given for two benchmarking examples from the literature. We also discuss two real-world applications of scheduling problems that cannot be readily accommodated using existing methods. For the sake of completeness, other alternative solution methods applied in the field of scheduling are also reviewed, followed by a discussion related to solving large-scale problems through rigorous optimization approaches. Finally, we list available academic and commercial software, and briefly address the issue of rescheduling capabilities of the various optimization approaches as well as important extensions that go beyond short-term batch scheduling.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,371
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
(1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90039-f · Cited by 1,440
Panwalkar, S. S., & Iskander, W. (1977) · Operations Research · doi:10.1287/opre.25.1.45 · Cited by 1,294
Constraint satisfaction in logic programming
Hentenryck, P. V. (1989) · Medical Entomology and Zoology · Cited by 1,218
Glover, F. (1990) · Interfaces · doi:10.1287/inte.20.4.74 · Cited by 1,092
A state-of-the-art survey of dispatching rules for manufacturing job shop operations
BLACKSTONE, J. H., PHILLIPS, D. T., & HOGG, G. L. (1982) · International Journal of Production Research · doi:10.1080/00207548208947745 · Cited by 1,013
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (2005) · Computational Management Science · doi:10.1007/s10287-004-0020-y · Cited by 837
Agent-Based Systems for Intelligent Manufacturing: A State-of-the-Art Survey
Shen, W., & Norrie, D. H. (1999) · Knowledge and Information Systems · doi:10.1007/bf03325096 · Cited by 808
Battiti, R., & Tecchiolli, G. (1994) · ORSA Journal on Computing · doi:10.1287/ijoc.6.2.126 · Cited by 801
A tree-search algorithm for mixed integer programming problems
Dakin, R. J. (1965) · The Computer Journal · doi:10.1093/comjnl/8.3.250 · Cited by 640
Zweben, M., & Fox, M. S. (1998) · Cited by 620
The Constraint Logic Programming Language CHIP.
Dincbas, M., Hentenryck, P. V., Simonis, H., Aggoun, A., Graf, T., & Berthier, F. (1988) · Future Generation Computer Systems · Cited by 508
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
Jain, V., & Grossmann, I. E. (2001) · INFORMS Journal on Computing · doi:10.1287/ijoc.13.4.258.9733 · Cited by 400
Self-citationSolving Real-World Linear Programs: A Decade and More of Progress
Bixby, R. E. (2002) · Operations Research · doi:10.1287/opre.50.1.3.17780 · Cited by 386
Planning and scheduling in the process industry
Kallrath, J. (2002) · OR Spectrum · doi:10.1007/s00291-002-0101-7 · Cited by 367
Logic‐Based Methods for Optimization: Combining Optimization and Constraint Satisfaction
Hooker, J. (2000) · Wiley eBooks · doi:10.1002/9781118033036 · Cited by 292
MIP: Theory and Practice — Closing the Gap
Bixby, E. R., Fenelon, M., Gu, Z., Rothberg, E., & Wunderling, R. (2000) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-35514-6_2 · Cited by 258
Harjunkoski, I., & Grossmann, I. E. (2002) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(02)00100-x · Cited by 225
Self-citationProgress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
Johnson, E. L., Nemhauser, G. L., & Savelsbergh, M. W. P. (2000) · INFORMS Journal on Computing · doi:10.1287/ijoc.12.1.2.11900 · Cited by 206
Constraint Based Scheduling: Applying Constraint Programming to Scheduling Problems
Tsang, E. P. K. (2003) · Journal of Scheduling · doi:10.1023/a:1024016929283 · Cited by 203
Pape, C. L. (1994) · Intelligent Systems Engineering · doi:10.1049/ise.1994.0009 · Cited by 172
Overview of Scheduling and Planning of Batch Process Operations
Reklaitis, G. (1996) · Springer eBooks · doi:10.1007/978-3-642-60972-5_27 · Cited by 145
Integrating Budgeting Models into Scheduling and Planning Models for the Chemical Batch Industry
Romero, J., Badell, M., Bagajewicz, M. J., & Puigjaner, L. (2003) · Industrial & Engineering Chemistry Research · doi:10.1021/ie030312l · Cited by 44
Cited by
Business Process Analysis and Optimization: Beyond Reengineering
Vergidis, K., Tiwari, A., & Majeed, B. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2007.905812 · Cited by 305
Study on optimizing production scheduling for water-saving in textile dyeing industry
Zhou, L., Xu, K., Cheng, X., Xu, Y., & Jia, Q. (2017) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2016.09.047 · Cited by 62
Metadata
- Authors
- Méndez, C. A., Cerdá, J., Grossmann, I. E., Harjunkoski, I., & Fahl, M.
- Venue
- Computers & Chemical Engineering
- Publisher
- Elsevier BV
- Published
- 2006-05
- Volume
- 30
- Issue
- 6-7
- Pages
- 913-946
- ISSN
- 0098-1354 (ISSN-L)
- OpenAlex
- W2155900361
- Cited by
- 809
- References
- 28
- FWCI
- 102.89
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.