عنوان انگلیسی مقاله:
Optimization of extended business processes in digital supply chains using mathematical programming
ترجمه فارسی عنوان مقاله:
بهینه سازی فرآیندهای تجاری گسترده در زنجیره های تأمین دیجیتال با استفاده از برنامه ریزی ریاضی
Sciencedirect - Elsevier - Computers and Chemical Engineering, 152 (2021) 107323: doi:10:1016/j:compchemeng:2021:107323
Hector D. Perez
We propose a mathematical programming approach to optimize the business process transactions in digital supply chains. Five scheduling models from the Process Systems Engineering (PSE) area are applied
to schedule the processing of orders in a simplified Order-To-Cash (OTC) business process, which is modeled as a multistage network with parallel units (agents). Two case studies are presented to compare the
performance of the scheduling models on various sizes of a flexible jobshop representation of the OTC
process. The models are compared and scaled to select those that are more suitable to this application.
The continuous-time general precedence model provides an accurate representation of the real system
and performs well for small instances. The discrete-time State-Task Network (STN), however, proves most
efficient in terms of tractability, despite the well-known limitations resulting from discretizing time. The
tightness of the linear programming (LP) relaxations in the discrete-time STN framework, as well as the
ability of commercial solvers to perform preprocessing and apply heuristics to the STN formulation, enables finding near optimal solutions quickly even for larger instances.
Keywords: Business process optimization | digital supply chain | order-to-cash | scheduling | mathematical programming