作者: John M. Wassick , Satyajith Amaran , Ignacio E. Grossmann , Hector D. Perez , Esra Erisen
DOI: 10.1016/J.COMPCHEMENG.2021.107323
关键词:
摘要: Abstract We propose a mathematical programming approach to optimize the business process transactions in digital supply chains. Five scheduling models from Process Systems Engineering (PSE) area are applied schedule processing of orders simplified Order-To-Cash (OTC) process, which is modeled as multistage network with parallel units (agents). Two case studies presented compare performance on various sizes flexible jobshop representation OTC process. The compared and scaled select those that more suitable this application. continuous-time general precedence model provides an accurate real system performs well for small instances. discrete-time State-Task Network (STN), however, proves most efficient terms tractability, despite well-known limitations resulting discretizing time. tightness linear (LP) relaxations STN framework, ability commercial solvers perform preprocessing apply heuristics formulation, enables finding near optimal solutions quickly even larger