{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T21:16:12Z","timestamp":1783458972997,"version":"3.55.0"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001831","name":"Technische Universiteit Delft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001831","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100013405","name":"Rijksdienst voor Ondernemend Nederland","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100013405","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Chemical Engineering"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.compchemeng.2026.109739","type":"journal-article","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:13:57Z","timestamp":1780676037000},"page":"109739","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Constraint programming for scheduling a fermentation plant"],"prefix":"10.1016","volume":"213","author":[{"given":"Kim","family":"van den Houten","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0815-5149","authenticated-orcid":false,"given":"Eva","family":"Christopoulou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6992-2869","authenticated-orcid":false,"given":"Esteban","family":"Freydell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David M.J.","family":"Tax","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0470-6241","authenticated-orcid":false,"given":"Mathijs","family":"de Weerdt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.compchemeng.2026.109739_b1","article-title":"Microbial enzymes produced by fermentation and their applications in the food industry-A review","volume":"8","author":"Al-Maqtari","year":"2019","journal-title":"Int. J. Agric. Innov. Res."},{"key":"10.1016\/j.compchemeng.2026.109739_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.compchemeng.2021.107565","article-title":"A constraint programming model for makespan minimisation in batch manufacturing pharmaceutical facilities","volume":"156","author":"Awad","year":"2022","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.compchemeng.2026.109739_b3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1018995000688","article-title":"Satisfiability tests and time-bound adjustments for cumulative scheduling problems","volume":"92","author":"Baptiste","year":"1999","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.compchemeng.2026.109739_b4","series-title":"Constraint-based Scheduling: Applying Constraint Programming to Scheduling Problems","author":"Baptiste","year":"2001"},{"key":"10.1016\/j.compchemeng.2026.109739_b5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02283745","article-title":"Scheduling project networks with resource constraints and time windows","volume":"16","author":"Bartusch","year":"1988","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"10.1016\/j.compchemeng.2026.109739_b6","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.ejor.2013.12.040","article-title":"A hybrid method for large-scale short-term scheduling of make-and-pack production processes","volume":"236","author":"Baumann","year":"2014","journal-title":"European J. Oper. Res."},{"issue":"24","key":"10.1016\/j.compchemeng.2026.109739_b7","doi-asserted-by":"crossref","first-page":"11002","DOI":"10.1021\/ie900734x","article-title":"Optimal short-term scheduling of large-scale multistage batch plants","volume":"48","author":"Castro","year":"2009","journal-title":"Ind. Eng. Chem. Res."},{"issue":"2","key":"10.1016\/j.compchemeng.2026.109739_b8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1002\/aic.12261","article-title":"Greedy algorithm for scheduling batch plants with sequence-dependent changeovers","volume":"57","author":"Castro","year":"2011","journal-title":"J. Am. Inst. Chem. Eng. (AIChE)"},{"issue":"319","key":"10.1016\/j.compchemeng.2026.109739_b9","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1080\/01621459.1967.10500917","article-title":"The normal approximation to the signed-rank sampling distribution when zero differences are present","volume":"62","author":"Cureton","year":"1967","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/j.compchemeng.2026.109739_b10","article-title":"Industrial-size job shop scheduling with constraint programming","volume":"9","author":"Da Col","year":"2022","journal-title":"Oper. Res. Perspect."},{"issue":"1\u20133","key":"10.1016\/j.compchemeng.2026.109739_b11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","article-title":"Temporal constraint networks","volume":"49","author":"Dechter","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.compchemeng.2026.109739_b12","series-title":"DelftBlue Supercomputer (Phase 2)","author":"Delft High Performance Computing Centre (DHPC)","year":"2024"},{"key":"10.1016\/j.compchemeng.2026.109739_b13","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.compchemeng.2018.08.040","article-title":"Optimal batch scheduling of a multiproduct dairy process using a combined optimization\/constraint programming approach","volume":"124","author":"Escobet Canal","year":"2019","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.compchemeng.2026.109739_b14","series-title":"International Conference on Principles and Practice of Constraint Programming","first-page":"149","article-title":"Simple and scalable time-table filtering for the cumulative constraint","author":"Gay","year":"2015"},{"key":"10.1016\/j.compchemeng.2026.109739_b15","doi-asserted-by":"crossref","first-page":"438","DOI":"10.3390\/pr7070438","article-title":"Optimization-based scheduling for the process industries: From theory to real-life industrial applications","volume":"7","author":"Georgiadis","year":"2019","journal-title":"Processes"},{"key":"10.1016\/j.compchemeng.2026.109739_b16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.compchemeng.2013.12.001","article-title":"Scope for industrial applications of production scheduling models and solution methods","volume":"62","author":"Harjunkoski","year":"2014","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.compchemeng.2026.109739_b17","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"26534","article-title":"Proactive and reactive constraint programming for stochastic project scheduling with maximal time-lags","volume":"39","author":"Van den Houten","year":"2025"},{"key":"10.1016\/j.compchemeng.2026.109739_b18","series-title":"IBM ILOG CPLEX Optimization Studio: CP Optimizer","author":"IBM","year":"2024"},{"key":"10.1016\/j.compchemeng.2026.109739_b19","first-page":"205","article-title":"PSPLIB - a project scheduling problem library","author":"Kolisch","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.compchemeng.2026.109739_b20","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0098-1354(93)80015-F","article-title":"A general algorithm for short-term scheduling of batch operations","volume":"17","author":"Kondili","year":"1993","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"10.1016\/j.compchemeng.2026.109739_b21","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/j.ejor.2010.06.002","article-title":"MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: A benchmark scheduling problem of the pharmaceutical industry","volume":"207","author":"Kopanos","year":"2010","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.compchemeng.2026.109739_b22","series-title":"Modeling and solving scheduling problems with CP optimizer","author":"Laborie","year":"2015"},{"issue":"4","key":"10.1016\/j.compchemeng.2026.109739_b23","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10951-014-0408-7","article-title":"Temporal linear relaxation in IBM ILOG CP optimizer","volume":"19","author":"Laborie","year":"2016","journal-title":"J. Sched."},{"key":"10.1016\/j.compchemeng.2026.109739_b24","doi-asserted-by":"crossref","DOI":"10.1007\/s10601-018-9281-x","article-title":"IBM ILOG CP optimizer for scheduling: 20+ years of scheduling with constraints at IBM\/ILOG","volume":"23","author":"Laborie","year":"2018","journal-title":"Constraints"},{"key":"10.1016\/j.compchemeng.2026.109739_b25","series-title":"PyJobShop: Solving scheduling problems with constraint programming in Python","author":"Lan","year":"2025"},{"issue":"3","key":"10.1016\/j.compchemeng.2026.109739_b26","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","article-title":"An automatic method of solving discrete programming problems","volume":"28","author":"Land","year":"1960","journal-title":"Econometrica"},{"issue":"11","key":"10.1016\/j.compchemeng.2026.109739_b27","doi-asserted-by":"crossref","first-page":"2733","DOI":"10.1016\/j.ces.2009.03.002","article-title":"An approximate mathematical framework for resource-constrained multistage batch scheduling","volume":"64","author":"Marchetti","year":"2009","journal-title":"Chem. Eng. Sci."},{"issue":"4","key":"10.1016\/j.compchemeng.2026.109739_b28","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1016\/j.compchemeng.2008.12.007","article-title":"A general resource-constrained scheduling framework for multistage batch facilities with sequence-dependent changeovers","volume":"33","author":"Marchetti","year":"2009","journal-title":"Comput. Chem. Eng."},{"issue":"16","key":"10.1016\/j.compchemeng.2026.109739_b29","doi-asserted-by":"crossref","first-page":"5762","DOI":"10.1021\/ie202275y","article-title":"Simultaneous lot sizing and scheduling of multistage batch processes handling multiple orders per product","volume":"51","author":"Marchetti","year":"2012","journal-title":"Ind. Eng. Chem. Res."},{"issue":"3","key":"10.1016\/j.compchemeng.2026.109739_b30","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","article-title":"Job-shop scheduling with blocking and no-wait constraints","volume":"143","author":"Mascis","year":"2002","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.compchemeng.2026.109739_b31","series-title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01)","first-page":"494","article-title":"Dynamic control of plans with temporal uncertainty","author":"Morris","year":"2001"},{"key":"10.1016\/j.compchemeng.2026.109739_b32","doi-asserted-by":"crossref","DOI":"10.1287\/ijoc.2023.1287","article-title":"Mixed-integer programming vs. Constraint programming for shop scheduling problems: New results and outlook","volume":"35","author":"Naderi","year":"2023","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.compchemeng.2026.109739_b33","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.compchemeng.2016.04.030","article-title":"A novel constraint programming model for large-scale scheduling problems in multiproduct multistage batch plants: Limited resources and campaign-based operation","volume":"93","author":"Novara","year":"2016","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.compchemeng.2026.109739_b34","unstructured":"Pantelides, C., 1993. Unified Frameworks for Optimal Process Planning and Scheduling. In: Proceedings of the Second International Conference on Foundations of Computer-Aided Process Operations, 18-23 July. Crested Butte, United States, pp. 253\u2013273."},{"key":"10.1016\/j.compchemeng.2026.109739_b35","series-title":"OR-Tools","author":"Perron","year":"2024"},{"key":"10.1016\/j.compchemeng.2026.109739_b36","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"2016"},{"issue":"6","key":"10.1016\/j.compchemeng.2026.109739_b37","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1016\/j.compchemeng.2007.06.012","article-title":"Batch selection, assignment and sequencing in multi-stage multi-product processes","volume":"32","author":"Prasad","year":"2008","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.compchemeng.2026.109739_b38","article-title":"Applications of constraint programming in production scheduling problems: A descriptive bibliometric analysis","volume":"14","author":"Prata","year":"2024","journal-title":"Results Control. Optim."},{"key":"10.1016\/j.compchemeng.2026.109739_b39","series-title":"Handbook of Constraint Programming","author":"Rossi","year":"2006"},{"key":"10.1016\/j.compchemeng.2026.109739_b40","series-title":"International Conference on Principles and Practice of Constraint Programming","first-page":"417","article-title":"Using constraint programming and local search methods to solve vehicle routing problems","author":"Shaw","year":"1998"},{"issue":"17","key":"10.1016\/j.compchemeng.2026.109739_b41","doi-asserted-by":"crossref","first-page":"6648","DOI":"10.1021\/ie701737a","article-title":"Modeling of storage in batching and scheduling of multistage processes","volume":"47","author":"Sundaramoorthy","year":"2008","journal-title":"Ind. Eng. Chem. Res."},{"key":"10.1016\/j.compchemeng.2026.109739_b42","series-title":"Global Constraints in Scheduling","author":"Vil\u00edm","year":"2007"},{"key":"10.1016\/j.compchemeng.2026.109739_b43","series-title":"International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems","first-page":"230","article-title":"Timetable edge finding filtering algorithm for discrete cumulative resources","author":"Vil\u00edm","year":"2011"},{"key":"10.1016\/j.compchemeng.2026.109739_b44","series-title":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","first-page":"437","article-title":"Failure-directed search for constraint-based scheduling","author":"Vil\u00edm","year":"2015"},{"key":"10.1016\/j.compchemeng.2026.109739_b45","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","article-title":"SciPy 1.0: Fundamental algorithms for scientific computing in Python","volume":"17","author":"Virtanen","year":"2020","journal-title":"Nature Methods"},{"issue":"12","key":"10.1016\/j.compchemeng.2026.109739_b46","doi-asserted-by":"crossref","first-page":"2973","DOI":"10.1016\/j.compchemeng.2011.01.043","article-title":"A CP formulation for scheduling multiproduct multistage batch plants","volume":"35","author":"Zeballos","year":"2011","journal-title":"Comput. Chem. Eng."}],"container-title":["Computers & Chemical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0098135426001924?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0098135426001924?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T20:41:50Z","timestamp":1783456910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0098135426001924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":46,"alternative-id":["S0098135426001924"],"URL":"https:\/\/doi.org\/10.1016\/j.compchemeng.2026.109739","relation":{"is-supplemented-by":[{"id-type":"uri","id":"https:\/\/github.com\/kimvandenhouten\/pyjobshop_biomanufacturing","asserted-by":"subject"}]},"ISSN":["0098-1354"],"issn-type":[{"value":"0098-1354","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Constraint programming for scheduling a fermentation plant","name":"articletitle","label":"Article Title"},{"value":"Computers & Chemical Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.compchemeng.2026.109739","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"109739"}}