发表机构
Shenzhen International Graduate School, Tsinghua University; CIRRELT, Université Laval（清华大学深圳国际研究生院; 拉瓦尔大学 CIRRELT 中心）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对带返回车道的最小化完工时间汽车重排序问题，证明其NP完全性，提出集成约束规划的两阶段分支定价精确算法，显著扩大可解实例规模，并揭示返回车道可增强灵活性、支持更小缓冲区设计。
AI 中文摘要
问题定义：汽车重排序问题涉及通过中间缓冲区重新排列两个相邻生产车间之间的汽车序列。本研究探讨了一个新变体，当缓冲区具有多个前进车道和一条返回车道（RL）时，旨在最小化重排序完工时间。两种类型的车道均遵循先进先出规则，但运行方向相反。通过返回车道，汽车可以在前进车道之间循环，从而增加了重排序的灵活性和复杂性。目标是在时间上定位汽车，以在最短时间内完成目标序列变更。方法/结果：我们证明了该问题是NP完全的，并开发了一种与约束规划（BP-CP）集成的精确两阶段分支定价方法。第一阶段提出了三个主问题（MP）版本，每个版本配对一个在特定图上定义的子问题。利用分支产生的部分整数解，第二阶段构建的约束规划模型要么产生问题的可行解，要么产生添加到MP的可行性割。实验结果表明，BP-CP大大增加了生产批次可解实例的规模，尤其是在中等松弛的MP下。比较分析表明，返回车道显著增强了重排序灵活性，使得较小的缓冲区能够在不同的重排序复杂度下达到与没有返回车道的较大缓冲区相当的完工时间。管理启示：仅扩大车道容量在重排序性能上收益有限，甚至可能降低效率。返回车道相当于多条前进车道，支持更小且成本效益更高的缓冲区设计，同时保持高效的准时制运营。
英文摘要
Problem definition: The car resequencing problem involves rearranging the sequence of cars between two adjacent production shops via an intermediate buffer. This study explores a new variant that aims to minimize the resequencing makespan when the buffer features several forward lanes and a return lane (RL). Both types of lanes follow first-in-first-out rules, but operate in opposite directions. Through the RL, cars can circulate between forward lanes, thereby increasing resequencing flexibility and complexity. The goal is to position cars over time to complete the target sequence change in the shortest possible time. Methodology/results: We prove the problem is NP-complete and develop an exact two-stage branch-and-price approach integrated with constraint programming (BP-CP). Three versions of the master problem (MP) are proposed for the first stage, each paired with a subproblem defined on a specific graph. Using partial integer solutions from branching, a constraint-programming model built in the second stage yields either a feasible solution to the problem or a feasibility cut added to the MP. Experimental results indicate that BP-CP greatly increases the scale of solvable instances for a production batch, especially with a moderately relaxed MP. A comparative analysis shows that the RL markedly enhances resequencing flexibility, enabling smaller buffers to attain makespans comparable to those of larger buffers without the RL across varying resequencing complexities. Managerial implications: Expanding lane capacity alone yields limited gains in resequencing performance and may even reduce efficiency. The RL acts as several forward lanes, supporting a smaller and cost-effective buffer design while maintaining efficient just-in-time operations.
