xiongfuli
![]() |
- Associate Professor
- Supervisor of Master's Candidates
- Name (Pinyin):xiongfuli
- School/Department:信息与控制工程学院
- Education Level:With Certificate of Graduation for Doctorate Study
- Degree:Doctoral Degree in Engineering
- Professional Title:Associate Professor
- Status:Employed
- Academic Titles:西安建筑科技大学信息与控制工程学院副教授
- Alma Mater:东南大学
- Teacher College:信息与控制工程学院
- Discipline:Control Science and Engineering
Control Theory and Control Engineering
Systems Engineering

- Email:
- Paper Publications
Order acceptance and scheduling under eligibility, availability, and budget constraints in distributed heterogeneous flow shop production
Release time:2025-04-11 Hits:
- Impact Factor:7.5
- Journal:Expert Systems with Applications
- Key Words:The distributed manufacturing model enhances production flexibility and efficiency. This study investigates the order acceptance and scheduling problem in distributed heterogeneous factories while considering constraints including order-to-factory eligibility, processing time availability, and budget limitations, with the objective of maximizing total profit. The problem involves four interrelated decisions: order selection, allocation, sequencing, and scheduling. To address this, we formulate a Manne-based mixed-integer linear programming (MILP) model and a constraint programming (CP) model. However, these methods become computationally impractical for large instances. To improve efficiency, we develop three logic-based Benders decomposition (LBBD) algorithms that iteratively solve a master problem (MP) for order acceptance and allocation and subproblems (SPs) for scheduling within each factory. A local search (LS) algorithm is integrated to enhance solution quality and convergence speed. Experimental results validate the effectiveness of the proposed approach. For small-scale instances, our method achieves optimality where MILP and CP fail. In large-scale cases, it reduces the optimality gap by 54.2% and 100% across two scenarios while cutting solution time by 20.6%, 84.2%, and 98.3% in three scenarios. Applied to real-world scenarios, it increases total profit by 4.9%, confirming its practical value. These results demonstrate that the proposed LBBD framework significantly outperforms MILP and CP, solving larger instances efficiently with superior solution quality. Additionally, sensitivity analysis highlights key trade-offs in due date flexibility, budget constraints, and order distribution for optimizing scheduling performance.
- Co-author:景琳,向成飞,韩益彤
- First Author:熊福力
- Indexed by:Journal paper
- Document Code:127586
- Discipline:Interdisciplinary
- Document Type:J
- Volume:280
- Translation or Not:no
- Date of Publication:2025-01-01
- Included Journals:SCI
- Links to published journals:https://doi.org/10.1016/j.eswa.2025.127586