A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups
针对并行非相关机器且带设置时间的单阶段制造过程，提出一种混合近似方法，依次求解拉格朗日松弛对偶和拉格朗日分解对偶，为最优完工时间提供下界，并报告了计算结果。
A nonpreemptive single stage manufacturing process with parallel, unrelated machines and multiple job types with setups (PUMS) is considered. We propose a hybrid approximation procedure where a Lagrangean relaxation dual and a Lagrangean decomposition dual are solved one after the other to generate a good lower bound on the optimal makespan value. Computational results are reported.