Answers are grounded in this paper and cite their sources.
Competitive pressure and economic growth have driven firms to diversify their production locations to access customer and raw material markets. The resulting production networks require coordinated planning across multiple factories, leading to distributed scheduling problems. In industrial production networks, processing at certain machines requires specialized and costly tools that are only available at a subset of factories, thereby inducing factory-eligibility constraints. Despite their practical relevance, such constraints have been largely overlooked in the scheduling literature over the past 15 years. We address this gap by extending the distributed permutation flowshop scheduling problem to incorporate eligibility constraints arising from tool availability, evolving dynamically through tool transfers between factories. To support on-time delivery while accounting for geographically dispersed factories, the model incorporates factory-dependent due dates and minimizes total tardiness. Accordingly, we develop three solution approaches: a novel network-flow-based mixed-integer programming model, a constraint programming formulation, and a tailored Iterated Greedy algorithm that reduces total tardiness by an average of 7.7% compared to the constraint programming approach for large instances. Computational experiments further show that tool transfers reduce total tardiness by 21.67% on average compared with static tool allocation. A sensitivity analysis confirms that tool transfers remain beneficial across varying tool redundancy levels and geographic network configurations.
No takes yet. Share an insight, caveat, or question.
Schönheit et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: